draft-ietf-ccamp-gmpls-mln-reqs-01.txt   draft-ietf-ccamp-gmpls-mln-reqs-02.txt 
Network Working Group Kohei Shiomoto (NTT) Network Working Group Kohei Shiomoto (NTT)
Internet Draft Dimitri Papadimitriou (Alcatel) Internet Draft Dimitri Papadimitriou (Alcatel)
Jean-Louis Le Roux (France Telecom) Jean-Louis Le Roux (France Telecom)
Martin Vigoureux (Alcatel) Martin Vigoureux (Alcatel)
Deborah Brungard (AT&T) Deborah Brungard (AT&T)
Expires: April 2007 October 2006
Requirements for GMPLS-based multi-region and Requirements for GMPLS-based multi-region and
multi-layer networks (MRN/MLN) multi-layer networks (MRN/MLN)
draft-ietf-ccamp-gmpls-mln-reqs-01.txt draft-ietf-ccamp-gmpls-mln-reqs-02.txt
Status of this Memo Status of this Memo
By submitting this Internet-Draft, each author represents that any By submitting this Internet-Draft, each author represents that any
applicable patent or other IPR claims of which he or she is aware applicable patent or other IPR claims of which he or she is aware
have been or will be disclosed, and any of which he or she becomes have been or will be disclosed, and any of which he or she becomes
aware will be disclosed, in accordance with Section 6 of BCP 79. aware will be disclosed, in accordance with Section 6 of BCP 79.
This document may only be posted in an Internet-Draft. This document may only be posted in an Internet-Draft.
skipping to change at page 1, line 39 skipping to change at page 1, line 42
documents at any time. It is inappropriate to use Internet-Drafts documents at any time. It is inappropriate to use Internet-Drafts
as reference material or to cite them other than as "work in as reference material or to cite them other than as "work in
progress." 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 2006. This Internet-Draft will expire on April 2007.
Copyright Notice Copyright Notice
Copyright (C) The Internet Society (2006). Copyright (C) The Internet Society (2006).
Abstract Abstract
Most of the initial efforts on Generalized MPLS (GMPLS) have been Most of the initial efforts on Generalized MPLS (GMPLS) have been
related to environments hosting devices with a single switching related to environments hosting devices with a single switching
capability. The complexity raised by the control of such data capability. The complexity raised by the control of such data
planes is similar to that seen in classical IP/MPLS networks. planes is similar to that seen in classical IP/MPLS networks.
By extending MPLS to support multiple switching technologies, GMPLS By extending MPLS to support multiple switching technologies, GMPLS
provides a comprehensive framework for the control of a multi- provides a comprehensive framework for the control of a multi-
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
layered network of either a single switching technology or multiple layered network of either a single switching technology or multiple
switching technologies. In GMPLS, a switching technology domain switching technologies. In GMPLS, a switching technology domain
defines a region, and a network of multiple switching types is defines a region, and a network of multiple switching types is
referenced in this document as a multi-region network (MRN). When referenced in this document as a multi-region network (MRN). When
referring in general to a layered network, which may consist of referring in general to a layered network, which may consist of
either a single or multiple regions, this document uses the term, either a single or multiple regions, this document uses the term,
Multi-layer Network (MLN). This draft defines a framework for GMPLS Multi-layer Network (MLN). This draft defines a framework for GMPLS
based multi-region/multi-layer networks and lists a set of based multi-region/multi-layer networks and lists a set of
functional requirements. functional requirements.
skipping to change at page 2, line 31 skipping to change at page 2, line 33
3.3. Vertical and Horizontal interaction and integration..........6 3.3. Vertical and Horizontal interaction and integration..........6
4. Key concepts of GMPLS-based MLNs and MRNs......................7 4. Key concepts of GMPLS-based MLNs and MRNs......................7
4.1. Interface Switching Capability...............................7 4.1. Interface Switching Capability...............................7
4.2. Multiple Interface Switching Capabilities....................8 4.2. Multiple Interface Switching Capabilities....................8
4.2.1. Networks with multi-switching-type-capable hybrid nodes....8 4.2.1. Networks with multi-switching-type-capable hybrid nodes....8
4.3. Integrated Traffic Engineering (TE) and Resource Control.....9 4.3. Integrated Traffic Engineering (TE) and Resource Control.....9
4.3.1. Triggered signaling.......................................10 4.3.1. Triggered signaling.......................................10
4.3.2. FA-LSP....................................................10 4.3.2. FA-LSP....................................................10
4.3.3. Virtual network topology (VNT)............................11 4.3.3. Virtual network topology (VNT)............................11
5. Requirements..................................................11 5. Requirements..................................................11
5.1. Scalability.................................................11 5.1. Handling single-switching and multi-switching-type-capable
5.2. LSP resource utilization....................................12 nodes............................................................11
5.2.1. FA-LSP release and setup..................................12 5.2. Advertisement of the available adaptation resource..........12
5.2.2. Virtual TE-Link...........................................13 5.3. Scalability.................................................12
5.3. LSP Attribute inheritance...................................14 5.4. Stability...................................................12
5.4. Verification of the LSP.....................................14 5.5. Disruption minimization.....................................13
5.5. Disruption minimization.....................................14 5.6. LSP Attribute inheritance...................................13
5.6. Stability...................................................15 5.7. Computing paths with and without nested signaling...........14
5.7. Computing paths with and without nested signaling...........16 5.8. LSP resource utilization....................................15
5.8. Handling single-switching and multi-switching-type-capable 5.8.1. FA-LSP release and setup..................................15
nodes............................................................17 5.8.2. Virtual TE-Link...........................................16
5.9. Advertisement of the available adaptation resource..........17 5.9. Verification of the LSP.....................................17
6. Security Considerations.......................................17 6. Security Considerations.......................................17
7. References....................................................18 7. References....................................................17
7.1. Normative Reference.........................................18 7.1. Normative Reference.........................................17
7.2. Informative References......................................18 7.2. Informative References......................................18
8. Author's Addresses............................................19 8. Author's Addresses............................................19
9. Intellectual Property Considerations..........................20 9. Intellectual Property Considerations..........................20
10. Full Copyright Statement.....................................20 10. Full Copyright Statement.....................................20
1. Introduction 1. Introduction
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
Generalized MPLS (GMPLS) extends MPLS to handle multiple switching Generalized MPLS (GMPLS) extends MPLS to handle multiple switching
technologies: packet switching, layer-two switching, TDM switching, technologies: packet switching, layer-2 switching, TDM switching,
wavelength switching, and fiber switching (see [RFC3945]). The wavelength switching, and fiber switching (see [RFC3945]). The
Interface Switching Capability (ISC) concept is introduced for Interface Switching Capability (ISC) concept is introduced for
these switching technologies and is designated as follows: PSC these switching technologies and is designated as follows: PSC
(packet switch capable), L2SC (Layer-2 switch capable), TDM (Time (packet switch capable), L2SC (Layer-2 switch capable), TDM (Time
Division Multiplex capable), LSC (lambda switch capable), and FSC Division Multiplex capable), LSC (lambda switch capable), and FSC
(fiber switch capable). (fiber switch capable).
Service providers may operate networks where multiple different Service providers may operate networks where multiple different
switching technologies exist. The representation, in a GMPLS switching technologies exist. The representation, in a GMPLS
control plane, of a switching technology domain is referred to as a control plane, of a switching technology domain is referred to as a
skipping to change at page 3, line 30 skipping to change at page 3, line 32
network region. A layer describes a data plane switching network region. A layer describes a data plane switching
granularity level (e.g. VC4, VC-12). A data plane layer is granularity level (e.g. VC4, VC-12). A data plane layer is
associated with a region in the control plane (e.g. VC4 associated associated with a region in the control plane (e.g. VC4 associated
to TDM, IP associated to PSC). However, more than one data plane to TDM, IP associated to PSC). However, more than one data plane
layer can be associated to the same region (e.g. both VC4 and VC12 layer can be associated to the same region (e.g. both VC4 and VC12
are associated to TDM). Thus, a control plane region, identified by are associated to TDM). Thus, a control plane region, identified by
its switching type value (e.g. TDM), can itself be sub-divided into its switching type value (e.g. TDM), can itself be sub-divided into
smaller granularity based on the bandwidth that defines the "data smaller granularity based on the bandwidth that defines the "data
plane switching layers" e.g. from VC-11 to VC4-256c. The Interface plane switching layers" e.g. from VC-11 to VC4-256c. The Interface
Switching Capability Descriptor (ISCD) [RFC4202], identifying the Switching Capability Descriptor (ISCD) [RFC4202], identifying the
interface switching type, the encoding type and the switching interface switching capability (ISC), the encoding type and the
bandwidth granularity, enable the characterization of the switching bandwidth granularity, enable the characterization of the
associated layers. associated layers.
A network comprising transport nodes with multiple data plane A network comprising nodes with multiple data plane layers of
layers of either the same ISC or different ISCs, controlled by a either the same ISC or different ISCs, controlled by a single GMPLS
single GMPLS control plane instance is called a Multi-Layer Network control plane instance is called a Multi-Layer Network (MLN). To
(MLN). To differentiate a network supporting LSPs of different differentiate a network supporting LSPs of different switching
switching technologies (ISCs) from a single region network, a types from a single region network, a network supporting more than
network supporting more than one switching technology is called a one switching technology is called a Multi-Region Network (MRN).
Multi-Region Network (MRN). All MRNs are MLNs, by definition.
MLNs can be categorized according to the distribution of the ISCD MLNs can be categorized according to the distribution of the ISCD
values amongst the LSRs: values amongst the LSRs:
- Each LSR may support just one ISCD, and the MLN may be comprised - Each LSR may support just one ISCD, and the set of LSRs may
of LSRs that support different ISCDs. Such LSRs are known as comprised
LSRs that support different ISCDs. Such LSRs are known as
single-switching-type-capable LSRs. single-switching-type-capable LSRs.
- Each LSR may support more than one ISCD at the same time so that - Each LSR may support more than one ISCD at the same time. Such
the network containing these LSR is an MLN. Such LSRs are known LSRs are known
as multi-switching-type-capable LSRs, and can be further as multi-switching-type-capable LSRs, and can be further
classified as either "simplex" or "hybrid" nodes as defined in classified as either "simplex" or "hybrid" nodes as defined in
Section 4.2. Section 4.2.
- The MLN may be constructed from any combination of single- - The MLN may be constructed from any combination of single-
switching-type-capable LSRs and multi-switching-type-capable switching-type-capable LSRs and multi-switching-type-capable
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
LSRs. LSRs.
Since GMPLS provides a comprehensive framework for the control of Since GMPLS provides a comprehensive framework for the control of
different switching capabilities, a single GMPLS instance may be different switching capabilities, a single GMPLS instance may be
used to control the MLN enabling rapid service provisioning and used to control the MLN enabling rapid service provisioning and
efficient traffic engineering across all switching capabilities. In efficient traffic engineering across all switching capabilities. In
such networks, TE Links are consolidated into a single Traffic such networks, TE Links are consolidated into a single Traffic
Engineering Database (TED). Since this TED contains the information Engineering Database (TED). Since this TED contains the information
relative to all the different regions and layers existing in the relative to all the different regions and layers existing in the
network, a path across multiple regions or layers can be computed network, a path across multiple regions or layers can be computed
using this TED. Thus optimization of network resources can be using this TED. Thus optimization of network resources can be
achieved across the whole MLN. achieved across the whole MLN.
Consider, for example, a MRN consisting of packet-switch capable Consider, for example, a MRN consisting of packet-switch capable
routers and TDM cross-connects. Assume that a packet LSP is routed routers and TDM cross-connects. Assume that a packet LSP is routed
between source and destination packet-switchi capable routers, and between source and destination packet-switch capable routers, and
that the LSP can be routed across the PSC-region (i.e. utilizing that the LSP can be routed across the PSC-region (i.e. utilizing
only resources of the packet region topology). If the performance only resources of the packet region topology). If the performance
objective for the LSP is not satisfied, new TE links may be created objective for the LSP is not satisfied, new TE links may be created
between the packet-switch capable routers across the TDM-region between the packet-switch capable routers across the TDM-region
(for example, VC-12 links) and the LSP can be routed over those TE (for example, VC-12 links) and the LSP can be routed over those TE
links. Further, even if the LSP can be successfully established links. Further, even if the LSP can be successfully established
across the PSC-region, TDM hierarchical LSPs across the TDM region across the PSC-region, TDM hierarchical LSPs across the TDM region
between the packet-switch capable routers may be established and between the packet-switch capable routers may be established and
used if doing so is necessary to meet the operator's objectives for used if doing so is necessary to meet the operator's objectives for
network resources availability (e.g., link bandwidth, or adaptation network resources availability (e.g., link bandwidth, or adaptation
skipping to change at page 5, line 5 skipping to change at page 5, line 5
this document are to be interpreted as described in RFC 2119 this document are to be interpreted as described in RFC 2119
[RFC2119]. [RFC2119].
3. Positioning 3. Positioning
A multi-region network (MRN) is always a multi-layer network (MLN) A multi-region network (MRN) is always a multi-layer network (MLN)
since the network devices on region boundaries bring together since the network devices on region boundaries bring together
different ISCs. A MLN, however, is not necessarily a MRN since different ISCs. A MLN, however, is not necessarily a MRN since
multiple layers could be fully contained within a single region. multiple layers could be fully contained within a single region.
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
For example, VC12, VC4, and VC4-4c are different layers of the TDM For example, VC12, VC4, and VC4-4c are different layers of the TDM
region. region.
3.1. Data plane layers and control plane regions 3.1. Data plane layers and control plane regions
A data plane layer is a collection of network resources capable of A data plane layer is a collection of network resources capable of
terminating and/or switching data traffic of a particular format. terminating and/or switching data traffic of a particular format.
These resources can be used for establishing LSPs or connectionless These resources can be used for establishing LSPs or connectionless
traffic delivery. For example, VC-11 and VC4-64c represent two traffic delivery. For example, VC-11 and VC4-64c represent two
different layers. different layers.
skipping to change at page 6, line 4 skipping to change at page 6, line 4
provider's network may be provided with support from successively provider's network may be provided with support from successively
lower service layers. Service layers are realized via a hierarchy lower service layers. Service layers are realized via a hierarchy
of network layers located generally in several regions and commonly of network layers located generally in several regions and commonly
arranged according to the switching capabilities of network devices. arranged according to the switching capabilities of network devices.
For instance some customers purchase Layer 1 (i.e. transport) For instance some customers purchase Layer 1 (i.e. transport)
services from the service provider, some Layer 2 (e.g. ATM), while services from the service provider, some Layer 2 (e.g. ATM), while
others purchase Layer 3 (IP/MPLS) services. The service provider others purchase Layer 3 (IP/MPLS) services. The service provider
realizes the services by a stack of network layers located within realizes the services by a stack of network layers located within
one or more network regions. The network layers are commonly one or more network regions. The network layers are commonly
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
arranged according to the switching capabilities of the devices in arranged according to the switching capabilities of the devices in
the networks. Thus, a customer network may be provided on top of the networks. Thus, a customer network may be provided on top of
the GMPLS-based multi-region/multi-layer network. For example, a the GMPLS-based multi-region/multi-layer network. For example, a
Layer 1 service (realized via the network layers of TDM, and/or LSC, Layer 1 service (realized via the network layers of TDM, and/or LSC,
and/or FSC regions) may support a Layer 2 network (realized via ATM and/or FSC regions) may support a Layer 2 network (realized via ATM
VP/VC) which may itself support a Layer 3 network (IP/MPLS region). VP/VC) which may itself support a Layer 3 network (IP/MPLS region).
The supported data plane relationship is a data-plane client-server The supported data plane relationship is a data-plane client-server
relationship where the lower layer provides a service for the relationship where the lower layer provides a service for the
higher layer using the data links realized in the lower layer. higher layer using the data links realized in the lower layer.
skipping to change at page 6, line 39 skipping to change at page 6, line 41
retain common signaling. retain common signaling.
3.3. Vertical and Horizontal interaction and integration 3.3. Vertical and Horizontal interaction and integration
Vertical interaction is defined as the collaborative mechanisms Vertical interaction is defined as the collaborative mechanisms
within a network element that is capable of supporting more than within a network element that is capable of supporting more than
one layer and of realizing the client/server relationships between one layer and of realizing the client/server relationships between
them. Protocol exchanges between two network controllers managing them. Protocol exchanges between two network controllers managing
different regions or layers are also a vertical interaction. different regions or layers are also a vertical interaction.
Integration of these interactions as part of the control plane is Integration of these interactions as part of the control plane is
referred to as vertical integration. Thus, this refers thus to the referred to as vertical integration. Thus, this refers to the
collaborative mechanisms within a single control plane instance collaborative mechanisms within a single control plane instance
driving multiple network layers. Such a concept is useful in order driving multiple network layers. Such a concept is useful in order
to construct a framework that facilitates efficient network to construct a framework that facilitates efficient network
resource usage and rapid service provisioning in carrier's networks resource usage and rapid service provisioning in carrier's networks
that are based on multiple layers, switching technologies, or ISCDs. that are based on multiple layers, switching technologies, or ISCDs.
Horizontal interaction is defined as the protocol exchange between Horizontal interaction is defined as the protocol exchange between
network controllers that manage transport nodes within a given network controllers that manage transport nodes within a given
layer or region (i.e. nodes with the same switching capability). layer or region (i.e. nodes with the same switching capability).
For instance, the control plane interaction between two TDM network For instance, the control plane interaction between two TDM network
elements switching at OC-48 is an example of horizontal interaction. elements switching at OC-48 is an example of horizontal interaction.
GMPLS protocol operations handle horizontal interactions within the GMPLS protocol operations handle horizontal interactions within the
same routing area. The case where the interaction takes place same routing area. The case where the interaction takes place
across a domain boundary, such as between two routing areas within across a domain boundary, such as between two routing areas within
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
the same network layer, is currently being evaluated as part of the the same network layer, is currently being evaluated as part of the
inter-domain work [Inter-domain], and is referred to as horizontal inter-domain work [Inter-domain], and is referred to as horizontal
integration. Thus horizontal integration refers to the integration. Thus horizontal integration refers to the
collaborative mechanisms between network partitions and/or collaborative mechanisms between network partitions and/or
administrative divisions such as routing areas or autonomous administrative divisions such as routing areas or autonomous
systems. systems.
This distinction needs further clarification when administrative This distinction needs further clarification when administrative
domains match layer boundaries. Horizontal interaction is extended domains match layer boundaries. Horizontal interaction is extended
to cover such cases. For example, the collaborative mechanisms in to cover such cases. For example, the collaborative mechanisms in
skipping to change at page 8, line 5 skipping to change at page 8, line 5
The ISC value is advertised as a part of the Interface Switching The ISC value is advertised as a part of the Interface Switching
Capability Descriptor (ISCD) attribute (sub-TLV) of a TE link end Capability Descriptor (ISCD) attribute (sub-TLV) of a TE link end
associated with a particular link interface [RFC4202]. Apart from associated with a particular link interface [RFC4202]. Apart from
the ISC, the ISCD contains information, including the encoding type, the ISC, the ISCD contains information, including the encoding type,
the bandwidth granularity, and the unreserved bandwidth on each of the bandwidth granularity, and the unreserved bandwidth on each of
eight priorities at which LSPs can be established. The ISCD does eight priorities at which LSPs can be established. The ISCD does
not "identify" network layers, it uniquely characterizes not "identify" network layers, it uniquely characterizes
information associated to one or more network layers. information associated to one or more network layers.
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
TE link end advertisements may contain multiple ISCDs. This can be TE link end advertisements may contain multiple ISCDs. This can be
interpreted as advertising a multi-layer (or multi-switching) TE interpreted as advertising a multi-layer (or multi-switching) TE
link end. That is, the TE link end is present in multiple layers. link end. That is, the TE link end is present in multiple layers.
4.2. Multiple Interface Switching Capabilities 4.2. Multiple Interface Switching Capabilities
In an MLN, network elements may be single-switching or multi- In an MLN, network elements may be single-switching or multi-
switching-type-capable nodes. Single-switching type capable nodes switching-type-capable nodes. Single-switching type capable nodes
advertise the same ISC value as part of their ISCD sub-TLV(s) to advertise the same ISC value as part of their ISCD sub-TLV(s) to
describe the termination capabilities of their TE Link(s). This describe the termination capabilities of their TE Link(s). This
skipping to change at page 8, line 50 skipping to change at page 8, line 52
4.2.1. Networks with multi-switching-type-capable hybrid nodes 4.2.1. Networks with multi-switching-type-capable hybrid nodes
The network contains at least one hybrid node, zero or more simplex The network contains at least one hybrid node, zero or more simplex
nodes, and a set of single-switching-type-capable nodes. nodes, and a set of single-switching-type-capable nodes.
Figure 5a shows an example hybrid node. The hybrid node has two Figure 5a shows an example hybrid node. The hybrid node has two
switching elements (matrices), which support, for instance, TDM and switching elements (matrices), which support, for instance, TDM and
PSC switching respectively. The node terminates a PSC and a TDM PSC switching respectively. The node terminates a PSC and a TDM
link (Link1 and Link2 respectively). It also has an internal link link (Link1 and Link2 respectively). It also has an internal link
connecting the two swtching elements. connecting the two switching elements.
The two switching elements are internally interconnected in such a The two switching elements are internally interconnected in such a
way that it is possible to terminate some of the resources of, say, way that it is possible to terminate some of the resources of, say,
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
Link2 and provide adaptation for PSC traffic received/sent over the Link2 and provide adaptation for PSC traffic received/sent over the
PSC interface (#b). This situation is modeled in GMPLS by PSC interface (#b). This situation is modeled in GMPLS by
connecting the local end of Link2 to the TDM switching element via connecting the local end of Link2 to the TDM switching element via
an additional interface realizing the termination/adaptation an additional interface realizing the termination/adaptation
function. Two ways are possible to set up PSC LSPs. Available function. Two ways are possible to set up PSC LSPs. Available
resource advertisement e.g. Unreserved and Min/Max LSP Bandwidth resource advertisement e.g. Unreserved and Min/Max LSP Bandwidth
should cover both two ways. should cover both two ways.
Network element Network element
............................. .............................
skipping to change at page 10, line 5 skipping to change at page 10, line 5
4.3.3) 4.3.3)
- provisioning of end-to-end LSPs with dynamic triggering of FA - provisioning of end-to-end LSPs with dynamic triggering of FA
LSPs LSPs
Note that in a multi-layer/multi-region network that includes Note that in a multi-layer/multi-region network that includes
multi-switching-type-capable nodes, an explicit route used to multi-switching-type-capable nodes, an explicit route used to
establish an end-to-end LSP can specify nodes that belong to establish an end-to-end LSP can specify nodes that belong to
different layers or regions. In this case, a mechanism to control different layers or regions. In this case, a mechanism to control
the dynamic creation of FA LSPs may be required. the dynamic creation of FA LSPs may be required.
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
There is a full spectrum of options to control how FA LSPs are There is a full spectrum of options to control how FA LSPs are
dynamically established. The process can be subject to the control dynamically established. The process can be subject to the control
of a policy, which may be set by a management component, and which of a policy, which may be set by a management component, and which
may require that the management plane is consulted at the time that may require that the management plane is consulted at the time that
the FA LSP is established. Alternatively, the FA LSP can be the FA LSP is established. Alternatively, the FA LSP can be
established at the request of the control plane without any established at the request of the control plane without any
management control. management control.
4.3.1. Triggered signaling 4.3.1. Triggered signaling
skipping to change at page 11, line 5 skipping to change at page 11, line 5
LSP Hierarchy. A set of FA-LSPs across or within a lower layer can LSP Hierarchy. A set of FA-LSPs across or within a lower layer can
be used during path selection by a higher layer LSP. Likewise, the be used during path selection by a higher layer LSP. Likewise, the
higher layer LSPs may be carried over dynamic data links realized higher layer LSPs may be carried over dynamic data links realized
via LSPs (just as they are carried over any "regular" static data via LSPs (just as they are carried over any "regular" static data
links). This process requires the nesting of LSPs through a links). This process requires the nesting of LSPs through a
hierarchical process [RFC4206]. The TED contains a set of LSP hierarchical process [RFC4206]. The TED contains a set of LSP
advertisements from different layers that are identified by the advertisements from different layers that are identified by the
ISCD contained within the TE link advertisement associated with the ISCD contained within the TE link advertisement associated with the
LSP [RFC4202]. LSP [RFC4202].
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
If a lower layer LSP is not advertised as an FA, it can still be If a lower layer LSP is not advertised as an FA, it can still be
used to carry higher layer LSPs across the lower layer. For example, used to carry higher layer LSPs across the lower layer. For example,
if the LSP is set up using triggered signaling, it will be used to if the LSP is set up using triggered signaling, it will be used to
carry the higher layer LSP that caused the trigger. Further, the carry the higher layer LSP that caused the trigger. Further, the
lower layer remains available for use by other higher layer LSPs lower layer remains available for use by other higher layer LSPs
arriving at the boundary. arriving at the boundary.
4.3.3. Virtual network topology (VNT) 4.3.3. Virtual network topology (VNT)
A set of one or more of lower-layer LSPs provides information for A set of one or more of lower-layer LSPs provides information for
skipping to change at page 11, line 42 skipping to change at page 11, line 44
capacity of the network, can be optimized [MAMLTE]. Reconfiguration capacity of the network, can be optimized [MAMLTE]. Reconfiguration
is performed by computing the new VNT from the traffic demand is performed by computing the new VNT from the traffic demand
matrix and optionally from the current VNT. Exact details are matrix and optionally from the current VNT. Exact details are
outside the scope of this document. However, this method may be outside the scope of this document. However, this method may be
tailored according to the service provider's policy regarding tailored according to the service provider's policy regarding
network performance and quality of service (delay, loss/disruption, network performance and quality of service (delay, loss/disruption,
utilization, residual capacity, reliability). utilization, residual capacity, reliability).
5.Requirements 5.Requirements
5.1. Scalability 5.1.Handling single-switching and multi-switching-type-capable nodes
The MRN/MLN can consist of single-switching-type-capable and multi-
switching-type-capable nodes. The path computation mechanism in the
MLN SHOULD be able to compute paths consisting of any combination
of such nodes.
Both single-switching-type-capable and multi-switching-type-capable
(simplex or hybrid) nodes could play the role of layer boundary.
MRN/MLN Path computation SHOULD handle TE topologies built of any
combination of nodes
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
5.2. Advertisement of the available adaptation resource
A hybrid node SHOULD maintain resources and advertise the resource
information on its internal links, the links required for vertical
(layer) integration. Likewise, path computation elements SHOULD be
prepared to use the availability of termination/adaptation
resources as a constraint in MRN/MLN path computations to reduce
the higher layer LSP setup blocking probability because of the lack
of necessary termination/ adaptation resources in the lower
layer(s).
The advertisement of the adaptation capability to terminate LSPs of
lower-region and forward traffic in the upper-region is REQUIRED,
as it provides critical information when performing multi-region
path computation.
The mechanism SHOULD cover the case where the upper-layer links
which are directly connected to upper-layer switching element and
the ones which are connected through internal links between upper-
layer element and lower-layer element coexist (See section 4.2.1).
5.3. Scalability
The MRN/MLN relies on a unified traffic engineering and routing The MRN/MLN relies on a unified traffic engineering and routing
model. The TED in each LSR is populated with TE-links from all model. The TED in each LSR is populated with TE-links from all
layers of all regions. This may lead to a huge amount of layers of all regions. This may lead to a huge amount of
information that has to be flooded and stored within the network. information that has to be flooded and stored within the network.
Furthermore, path computation times, which may be of great Furthermore, path computation times, which may be of great
importance during restoration, will depend on the size of the TED. importance during restoration, will depend on the size of the TED.
Thus MRN/MLN routing mechanisms MUST be designed to scale well with Thus MRN/MLN routing mechanisms MUST be designed to scale well with
an increase of any of the following: an increase of any of the following:
skipping to change at page 12, line 15 skipping to change at page 12, line 48
- Number of nodes - Number of nodes
- Number of TE-links (including FA-LSPs) - Number of TE-links (including FA-LSPs)
- Number of LSPs - Number of LSPs
- Number of regions and layers - Number of regions and layers
- Number of ISCDs per TE-link. - Number of ISCDs per TE-link.
Further, design of the routing protocols MUST NOT prevent TE Further, design of the routing protocols MUST NOT prevent TE
information filtering based on ISCDs. Signaling protocol SHOULD be information filtering based on ISCDs. Signaling protocol SHOULD be
able to operate on partial TE information. able to operate on partial TE information.
5.2. LSP resource utilization 5.4.Stability
Path computation is dependent on the network topology and
associated link state. The path computation stability of an upper
layer may be impaired if the VNT changes frequently and/or if the
status and TE parameters (TE metric for instance) of links in the
virtual network topology changes frequently.
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
In this context, robustness of the VNT is defined as the capability
to smooth changes that may occur and avoid their propagation into
higher layers. Changes of the VNT may be caused by the creation,
deletion, or modification of several LSPs.
Creation, deletion and modification of LSPs MAY be triggered by
adjacent layers or through operational actions to meet traffic
demand changes, topology changes, signaling requests from the upper
layer, and network failures. Routing robustness SHOULD be traded
with adaptability with respect to the change of incoming traffic
requests.
A full mesh of LSPs MAY be created between every pair of border
nodes of the higher layer. The merit of a full mesh of PSC TE-LSPs
is that it provides stability to the higher layer routing. That is,
the TED or forwarding table used in the higher layer of a PSC-LSR
is not impacted by routing changes within the lower-layer (e.g.,
TDM layer). Further, there is always full PSC reachability and
immediate access to bandwidth to support LSPs in the higher layer.
But it also has significant drawbacks, since it requires the
maintenance of n^2 RSVP-TE sessions, which may be quite CPU and
memory consuming (scalability impact). Also this may lead to
significant bandwidth wastage if LSPs with a certain amount of
reserved bandwidth are used.
Note that the use of virtual TE-links solves the bandwidth wastage
issue, and may reduce the control plane overload.
5.5.Disruption minimization
When reconfiguring the VNT according to a change in traffic demand,
the upper-layer LSP might be disrupted. Such disruption to the
upper layers MUST be minimized.
When residual resource decreases to a certain level, some lower
layer LSPs MAY be released according to local or network policies.
There is a trade-off between minimizing the amount of resource
reserved in the lower layer and disrupting higher layer traffic
(i.e. moving the traffic to other TE-LSPs so that some LSPs can be
released). Such traffic disruption MAY be allowed but MUST be under
the control of policy that can be configured by the operator. Any
repositioning of traffic MUST be as non-disruptive as possible (for
example, using make-before-break).
5.6.LSP Attribute inheritance
TE-Link parameters SHOULD be inherited from the parameters of the
LSP that provides the TE-link, and so from the TE-links in the
lower layer that are traversed by the LSP.
These include:
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
- Interface Switching Capability
- TE metric
- Maximum LSP bandwidth per priority level
- Unreserved bandwidth for all priority levels
- Maximum Reservable bandwidth
- Protection attribute
- Minimum LSP bandwidth (depending on the Switching Capability)
Inheritance rules MUST be applied based on specific policies.
Particular attention should be given to the inheritance of TE
metric (which may be other than a strict sum of the metrics of the
component TE links at the lower layer) and protection attributes.
5.7.Computing paths with and without nested signaling
Path computation MAY take into account LSP region and layer
boundaries when computing a path for an LSP. For example, path
computation MAY restrict the path taken by an LSP to only the links
whose interface switching capability is PSC.
Interface switching capability is used as a constraint in path
computation. For example, a TDM-LSP is routed over the topology
composed of TE links of the same TDM layer. In calculating the path
for the LSP, the TED MAY be filtered to include only links where
both end include requested LSP switching type. In this way
hierarchical routing is done by using a TED filtered with respect
to switching capability (that is, with respect to particular layer).
If triggered signaling is allowed, the path computation mechanism
MAY produce a route containing multiple layers/regions. The path is
computed over the multiple layers/regions even if the path is not
"connected" in the same layer as the endpoints of the path exist.
Note that here we assume that triggered signaling will be invoked
to make the path "connected", when the upper-layer signaling
request arrives at the boundary node.
The upper-layer signaling request may contain an ERO that includes
only hops in the upper layer, in which case the boundary node is
responsible for triggered creating of the lower-layer FA-LSP using
a path of its choice, or for the selection of any available lower
layer LSP as a data link for the higher layer. This mechanism is
appropriate for environments where the TED is filtered in the
higher layer, where separate routing instances are used per layer,
or where administrative policies prevent the higher layer from
specifying paths through the lower layer.
Obviously, if the lower layer LSP has been advertised as a TE link
(virtual or real) into the higher layer, then the higher layer
signaling request may contain the TE link identifier and so
indicate the lower layer resources to be used. But in this case,
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
the path of the lower layer LSP can be dynamically changed by the
lower layer at any time.
Alternatively, the upper-layer signaling request may contain an ERO
specifying the lower layer FA-LSP route. In this case, the boundary
node is responsible for decision as to which it should use the path
contained in the strict ERO or it should re-compute the path within
in the lower-layer.
Even in case the lower-layer FA-LSPs are already established, a
signaling request may also be encoded as loose ERO. In this
situation, it is up to the boundary node to decide whether it
should a new lower-layer FA-LSP or it should use the existing
lower-layer FA-LSPs.
The lower-layer FA-LSP can be advertised just as an FA-LSP in the
upper-layer or an IGP adjacency can be brought up on the lower-
layer FA-LSP.
5.8. LSP resource utilization
It MUST be possible to utilize network resources efficiently. It MUST be possible to utilize network resources efficiently.
Particularly, resource usage in all layers SHOULD be optimized as a Particularly, resource usage in all layers SHOULD be optimized as a
whole (i.e., across all layers), in a coordinated manner, (i.e., whole (i.e., across all layers), in a coordinated manner, (i.e.,
taking all layers into account). The number of lower-layer LSPs taking all layers into account). The number of lower-layer LSPs
carrying upper-layer LSPs SHOULD be minimized (Note that multiple carrying upper-layer LSPs SHOULD be minimized (Note that multiple
LSPs MAY be used for load balancing). Unneccesary lower-layer LSPs, LSPs MAY be used for load balancing). Unneccesary lower-layer LSPs,
which would not carry any traffic by rerouting the traffic over it which would not carry any traffic by rerouting the traffic over it
to alternative lower-layer LSPs, SHOULD be avoided. to alternative lower-layer LSPs, SHOULD be avoided.
5.2.1. FA-LSP release and setup 5.8.1. FA-LSP release and setup
Statistical multiplexing can only be employed in PSC and L2SC Statistical multiplexing can only be employed in PSC and L2SC
regions. A PSC or L2SC LSP may or may not consume the maximum regions. A PSC or L2SC LSP may or may not consume the maximum
reservable bandwidth of the FA LSP that carries it. On the other reservable bandwidth of the FA LSP that carries it. On the other
hand, a TDM, or LSC LSP always consumes a fixed amount of bandwidth hand, a TDM, or LSC LSP always consumes a fixed amount of bandwidth
as long as it exists (and is fully instantiated) because as long as it exists (and is fully instantiated) because
statistical multiplexing is not available. statistical multiplexing is not available.
If there is low traffic demand, some FA LSPs that do not carry any If there is low traffic demand, some FA LSPs that do not carry any
LSP MAY be released so that lower-layer resources are released. LSP MAY be released so that lower-layer resources are released.
Note that if a small fraction of the available bandwidth of an FA- Note that if a small fraction of the available bandwidth of an FA-
LSP is still in use, the nested LSPs can also be re-routed to other LSP is still in use, the nested LSPs can also be re-routed to other
FA-LSPs (optionally using the make-before-break technique) to FA-LSPs (optionally using the make-before-break technique) to
complete free up the FA-LSP. Alternatively, the FA LSPs MAY be complete free up the FA-LSP. Alternatively, the FA LSPs MAY be
retained for future use. Release or retention of underutilized FA retained for future use. Release or retention of underutilized FA
LSPs is a policy decision. LSPs is a policy decision.
As part of the re-optimization process, the solution MUST allow As part of the re-optimization process, the solution MUST allow
rerouting of an FA LSP while keeping interface identifiers of rerouting of an FA LSP while keeping interface identifiers of
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
corresponding TE links unchanged. Further, this process MUST be corresponding TE links unchanged. Further, this process MUST be
possible while the FA LSP is carrying traffic (higher layer LSPs) possible while the FA LSP is carrying traffic (higher layer LSPs)
with minimal disruption to the traffic. with minimal disruption to the traffic.
Additional FA LSPs MAY also be created based on policy, which might Additional FA LSPs MAY also be created based on policy, which might
consider residual resources and the change of traffic demand across consider residual resources and the change of traffic demand across
the region. By creating the new FA LSPs, the network performance the region. By creating the new FA LSPs, the network performance
such as maximum residual capacity may increase. such as maximum residual capacity may increase.
As the number of FA LSPs grows, the residual resource may decrease. As the number of FA LSPs grows, the residual resource may decrease.
In this case, re-optimization of FA LSPs MAY be invoked according In this case, re-optimization of FA LSPs MAY be invoked according
to policy. to policy.
Any solution MUST include measures to protect against network Any solution MUST include measures to protect against network
destabilization caused by the rapid setup and teardown of LSPs as destabilization caused by the rapid setup and teardown of LSPs as
traffic demand varies near a threshold. traffic demand varies near a threshold.
5.2.2. Virtual TE-Link 5.8.2. Virtual TE-Link
It may be considered disadvantageous to fully instantiate (i.e. It may be considered disadvantageous to fully instantiate (i.e.
pre-provision) the set of lower layer LSPs that provide the VNT pre-provision) the set of lower layer LSPs that provide the VNT
since this might reserve bandwidth that could be used for other since this might reserve bandwidth that could be used for other
LSPs in the absence of the upper-layer traffic. LSPs in the absence of the upper-layer traffic.
However, in order to allow path computation of upper-layer LSPs However, in order to allow path computation of upper-layer LSPs
across the lower-layer, the lower-layer LSPs MAY be advertised into across the lower-layer, the lower-layer LSPs MAY be advertised into
the upper-layer as though they had been fully established, but the upper-layer as though they had been fully established, but
without actually establishing them. Such TE links that represent without actually establishing them. Such TE links that represent
skipping to change at page 13, line 46 skipping to change at page 17, line 4
the underlying LSP MUST be immediately signaled in the lower layer. the underlying LSP MUST be immediately signaled in the lower layer.
If virtual TE-Links are used in place of pre-established LSPs, the If virtual TE-Links are used in place of pre-established LSPs, the
TE-links across the upper-layer can remain stable using pre- TE-links across the upper-layer can remain stable using pre-
computed paths while wastage of bandwidth within the lower-layer computed paths while wastage of bandwidth within the lower-layer
and unnecessary reservation of adaptation ports at the border nodes and unnecessary reservation of adaptation ports at the border nodes
can be avoided. can be avoided.
The concept of the VNT can be extended to allow the virtual TE- The concept of the VNT can be extended to allow the virtual TE-
links to form part of the VNT. The combination of the fully links to form part of the VNT. The combination of the fully
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
provisioned TE-links and the virtual TE-links defines the VNT provisioned TE-links and the virtual TE-links defines the VNT
provided by the lower layer. provided by the lower layer.
The solution SHOULD provide operations to facilitate the build-up The solution SHOULD provide operations to facilitate the build-up
of such virtual TE-links, taking into account the (forecast) of such virtual TE-links, taking into account the (forecast)
traffic demand and available resource in the lower-layer. traffic demand and available resource in the lower-layer.
Virtual TE-links MAY be modified dynamically (by adding or removing virtual TE-links MAY be modified dynamically (by adding or removing
virtual TE links, or chancing their capacity) according to the virtual TE links, or chancing their capacity) according to the
change of the (forecast) traffic demand and the available resource change of the (forecast) traffic demand and the available resource
in the lower-layer. in the lower-layer.
Any solution MUST include measures to protect against network Any solution MUST include measures to protect against network
destabilization caused by the rapid changes in the virtual network destabilization caused by the rapid changes in the virtual network
topology as traffic demand varies near a threshold. topology as traffic demand varies near a threshold.
The VNT can be changed by setting up and/or tearing down virtual TE The VNT can be changed by setting up and/or tearing down virtual TE
links as well as by modifying real links (i.e. the fully links as well as by modifying real links (i.e. the fully
provisioned LSPs). provisioned LSPs).
The maximum number of virtual TE links that can be defined SHOULD The maximum number of virtual TE links that can be defined SHOULD
be configurable. be configurable.
How to design the VNT and how to manage it are out of scope of this How to design the VNT and how to manage it are out of scope of this
document. document.
5.3. LSP Attribute inheritance 5.9. Verification of the LSP
TE-Link parameters SHOULD be inherited from the parameters of the
LSP that provides the TE-link, and so from the TE-links in the
lower layer that are traversed by the LSP.
These include:
- Interface Switching Capability
- TE metric
- Maximum LSP bandwidth per priority level
- Unreserved bandwidth for all priority levels
- Maximum Reservable bandwidth
- Protection attribute
- Minimum LSP bandwidth (depending on the Switching Capability)
Inheritance rules MUST be applied based on specific policies.
Particular attention should be given to the inheritance of TE
metric (which may be other than a strict sum of the metrics of the
component TE links at the lower layer) and protection attributes.
5.4. Verification of the LSP
When a lower layer LSP is established for use as a data link by a When a lower layer LSP is established for use as a data link by a
higher layer, the LSP MAY be verified for correct connectivity and higher layer, the LSP MAY be verified for correct connectivity and
data integrity. Such mechanisms are data technology-specific and data integrity. Such mechanisms are data technology-specific and
are beyond the scope of this document, but may be coordinated are beyond the scope of this document, but may be coordinated
through the GMPLS control plane. through the GMPLS control plane.
5.5. Disruption minimization
When reconfiguring the VNT according to a change in traffic demand,
the upper-layer LSP might be disrupted. Such disruption to the
upper layers MUST be minimized.
When residual resource decreases to a certain level, some lower
layer LSPs MAY be released according to local or network policies.
There is a trade-off between minimizing the amount of resource
reserved in the lower layer and disrupting higher layer traffic
(i.e. moving the traffic to other TE-LSPs so that some LSPs can be
released). Such traffic disruption MAY be allowed but MUST be under
the control of policy that can be configured by the operator. Any
repositioning of traffic MUST be as non-disruptive as possible (for
example, using make-before-break).
5.6. Stability
Path computation is dependent on the network topology and
associated link state. The path computation stability of an upper
layer may be impaired if the VNT changes frequently and/or if the
status and TE parameters (TE metric for instance) of links in the
virtual network topology changes frequently.
In this context, robustness of the VNT is defined as the capability
to smooth changes that may occur and avoid their propagation into
higher layers. Changes of the VNT may be caused by the creation,
deletion, or modification of several LSPs.
Creation, deletion and modification of LSPs MAY be triggered by
adjacent layers or through operational actions to meet traffic
demand changes, topology changes, signaling requests from the upper
layer, and network failures. Routing robustness SHOULD be traded
with adaptability with respect to the change of incoming traffic
requests.
A full mesh of LSPs MAY be created between every pair of border
nodes of the higher layer. The merit of a full mesh of PSC TE-LSPs
is that it provides stability to the higher layer routing. That is,
the TED or forwarding table used in the higher layer of an PSC-LSR
is not impacted by routing changes within the lower-layer (e.g.,
TDM layer). Further, there is always full PSC reachability and
immediate access to bandwidth to support LSPs in the higher layer.
But it also has significant drawbacks, since it requires the
maintenance of n^2 RSVP-TE sessions, which may be quite CPU and
memory consuming (scalability impact). Also this may lead to
significant bandwidth wastage if LSPs with a certain amount of
reserved bandwidth are used.
Note that the use of virtual TE-links solves the bandwidth wastage
issue, and may reduce the control plane overload.
5.7. Computing paths with and without nested signaling
Path computation MAY take into account LSP region and layer
boundaries when computing a path for an LSP. For example, path
computation MAY restrict the path taken by an LSP to only the links
whose interface switching capability is PSC.
Interface switching capability is used as a constraint in path
computation. For example, a TDM-LSP is routed over the topology
composed of TE links of the same TDM layer. In calculating the path
for the LSP, the TED MAY be filtered to include only links where
both end include requested LSP switching type. In this way
hierarchical routing is done by using a TED filtered with respect
to switching capability (that is, with respect to particular layer).
If triggered signaling is allowed, the path computation mechanism
MAY produce a route containing multiple layers/regions. The path is
computed over the multiple layers/regions even if the path is not
"connected" in the same layer as the endpoints of the path exist.
Note that here we assume that triggered signaling will be invoked
to make the path "connected", when the upper-layer signaling
request arrives at the boundary node.
The upper-layer signaling request may contain an ERO that includes
only hops in the upper layer, in which case the boundary node is
responsible for triggered creating of the lower-layer FA-LSP using
a path of its choice, or for the selection of any available lower
layer LSP as a data link for the higher layer. This mechanism is
appropriate for environments where the TED is filtered in the
higher layer, where separate routing instances are used per layer,
or where administrative policies prevent the higher layer from
specifying paths through the lower layer.
Obviously, if the lower layer LSP has been advertised as a TE link
(virtual or real) into the higher layer, then the higher layer
signaling request may contain the TE link identifier and so
indicate the lower layer resources to be used. But in this case,
the path of the lower layer LSP can be dynamically changed by the
lower layer at any time.
Alternatively, the upper-layer signaling request may contain an ERO
specifying the lower layer FA-LSP route. In this case, the boundary
node is responsible for decision as to which it should use the path
contained in the strict ERO or it should re-compute the path within
in the lower-layer.
Even in case the lower-layer FA-LSPs are already established, a
signaling request may also be encoded as loose ERO. In this
situation, it is up to the boundary node to decide whether it
should a new lower-layer FA-LSP or it should use the existing
lower-layer FA-LSPs.
The lower-layer FA-LSP can be advertised just as an FA-LSP in the
upper-layer or an IGP adjacency can be brought up on the lower-
layer FA-LSP.
5.8. Handling single-switching and multi-switching-type-capable
nodes
The MRN/MLN can consist of single-switching-type-capable and multi-
switching-type-capable nodes. The path computation mechanism in the
MLN SHOULD be able to compute paths consisting of any combination
of such nodes.
Both single-switching-type-capable and multi-switching-type-capable
(simplex or hybrid) nodes could play the role of layer boundary.
MRN/MLN Path computation SHOULD handle TE topologies built of any
combination of nodes
5.9. Advertisement of the available adaptation resource
A hybrid node SHOULD maintain resources and advertise the resource
information on its internal links, the links required for vertical
(layer) integration. Likewise, path computation elements SHOULD be
prepared to use the availability of termination/adaptation
resources as a constraint in MRN/MLN path computations to reduce
the higher layer LSP setup blocking probability because of the lack
of necessary termination/ adaptation resources in the lower
layer(s).
The advertisement of the adaptation capability to terminate LSPs of
lower-region and forward traffic in the upper-region is REQUIRED,
as it provides critical information when performing multi-region
path computation.
The mechanism SHOULD cover the case where the upper-layer links
which are directly connected to upper-layer switching element and
the ones which are connected through internal links between upper-
layer element and lower-layer element coexist (See section 4.2.1).
6. Security Considerations 6. Security Considerations
The current version of this document does not introduce any new The current version of this document does not introduce any new
security considerations as it only lists a set of requirements. In security considerations as it only lists a set of requirements. In
the future versions, new security requirements may be added. the future versions, new security requirements may be added.
7. References 7. References
7.1. Normative Reference 7.1. Normative Reference
[RFC2119] Bradner, S., "Key words for use in RFCs to [RFC2119] Bradner, S., "Key words for use in RFCs to
Indicate Requirement Levels", BCP 14, RFC 2119, Indicate Requirement Levels", BCP 14, RFC 2119,
March 1997. March 1997.
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
[RFC3979] Bradner, S., "Intellectual Property Rights in IETF [RFC3979] Bradner, S., "Intellectual Property Rights in IETF
Technology", BCP 79, RFC 3979, March 2005. Technology", BCP 79, RFC 3979, March 2005.
[RFC4202] K.Kompella and Y.Rekhter, "Routing Extensions in [RFC4202] K.Kompella and Y.Rekhter, "Routing Extensions in
Support of Generalized Multi-Protocol Label Support of Generalized Multi-Protocol Label
Switching (GMPLS)," RFC4202, October 2005. Switching (GMPLS)," RFC4202, October 2005.
[Inter-domain] A.Farrel, J-P. Vasseur, and A.Ayyangar, "A [Inter-domain] A.Farrel, J-P. Vasseur, and A.Ayyangar, "A
framework for inter-domain MPLS traffic framework for inter-domain MPLS traffic
engineering," draft-ietf-ccamp-inter-domain- engineering," draft-ietf-ccamp-inter-domain-
skipping to change at page 18, line 51 skipping to change at page 18, line 45
7.2. Informative References 7.2. Informative References
[MAMLTE] K. Shiomoto et al., "Multi-area multi-layer traffic [MAMLTE] K. Shiomoto et al., "Multi-area multi-layer traffic
engineering using hierarchical LSPs in GMPLS engineering using hierarchical LSPs in GMPLS
networks", draft-shiomoto-multiarea-te, work in networks", draft-shiomoto-multiarea-te, work in
progress. progress.
[MRN-EVAL] Le Roux, J.L., Brungard, D., Oki, E., Papadimitriou, D., [MRN-EVAL] Le Roux, J.L., Brungard, D., Oki, E., Papadimitriou, D.,
Shiomoto, K., Vigoureux, M.,"Evaluation of existing Shiomoto, K., Vigoureux, M.,"Evaluation of existing
GMPLS Protocols against Multi Layer and Multi Region GMPLS Protocols against Multi Layer and Multi Region
Networks (MLN/MRN)", draft-leroux-ccamp-gmpls-mrn- Networks (MLN/MRN)", draft-ietf-ccamp-gmpls-mrn-eval,
eval, work in progress. work in progress.
[IW-MIG-FW] Shiomoto, K., Papadimitriou, D., Le Roux, J.L., [IW-MIG-FW] Shiomoto, K., Papadimitriou, D., Le Roux, J.L.,
Brungard, D., Oki, E., Inoue, I., " Framework for Brungard, D., Oki, E., Inoue, I., " Framework for
IP/MPLS-GMPLS interworking in support of IP/MPLS to IP/MPLS-GMPLS interworking in support of IP/MPLS to
GMPLS migration ", draft-ietf-ccamp-mpls-gmpls- GMPLS migration ", draft-ietf-ccamp-mpls-gmpls-
interwork-fmwk-00.txt, work in progress. interwork-fmwk-00.txt, work in progress.
[AUTO-MESH] Vasseur, JP., Le Roux, JL., et al., "Routing [AUTO-MESH] Vasseur, JP., Le Roux, JL., et al., "Routing
extensions for discovery of Multiprotocol (MPLS) extensions for discovery of Multiprotocol (MPLS)
Label Switch Router (LSR) Traffic Engineering (TE) Label Switch Router (LSR) Traffic Engineering (TE)
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
mesh membership", draft-ietf-ccamp-automesh, work in mesh membership", draft-ietf-ccamp-automesh, work in
progress. progress.
8. Author's Addresses 8. Author's Addresses
Kohei Shiomoto Kohei Shiomoto
NTT Network Service Systems Laboratories NTT Network Service Systems Laboratories
3-9-11 Midori-cho, 3-9-11 Midori-cho,
Musashino-shi, Tokyo 180-8585, Japan Musashino-shi, Tokyo 180-8585, Japan
Email: shiomoto.kohei@lab.ntt.co.jp Email: shiomoto.kohei@lab.ntt.co.jp
skipping to change at page 20, line 4 skipping to change at page 19, line 44
Email: martin.vigoureux@alcatel.fr Email: martin.vigoureux@alcatel.fr
Deborah Brungard Deborah Brungard
AT&T AT&T
Rm. D1-3C22 - 200 Rm. D1-3C22 - 200
S. Laurel Ave., Middletown, NJ 07748, USA S. Laurel Ave., Middletown, NJ 07748, USA
Phone: +1 732 420 1573 Phone: +1 732 420 1573
Email: dbrungard@att.com Email: dbrungard@att.com
Contributors Contributors
Eiji Oki (NTT Network Service Systems Laboratories) Eiji Oki (NTT Network Service Systems Laboratories)
3-9-11 Midori-cho, Musashino-shi, Tokyo 180-8585, Japan 3-9-11 Midori-cho, Musashino-shi, Tokyo 180-8585, Japan
Phone: +81 422 59 3441 Email: oki.eiji@lab.ntt.co.jp Phone: +81 422 59 3441 Email: oki.eiji@lab.ntt.co.jp
Ichiro Inoue (NTT Network Service Systems Laboratories) Ichiro Inoue (NTT Network Service Systems Laboratories)
3-9-11 Midori-cho, Musashino-shi, Tokyo 180-8585, Japan 3-9-11 Midori-cho, Musashino-shi, Tokyo 180-8585, Japan
Phone: +81 422 59 3441 Email: ichiro.inoue@lab.ntt.co.jp Phone: +81 422 59 3441 Email: ichiro.inoue@lab.ntt.co.jp
Emmanuel Dotaro (Alcatel) Emmanuel Dotaro (Alcatel)
draft-ietf-ccamp-gmpls-mln-reqs-02.txt October 2006
Route de Nozay, 91461 Marcoussis cedex, France Route de Nozay, 91461 Marcoussis cedex, France
Phone : +33 1 6963 4723 Email: emmanuel.dotaro@alcatel.fr Phone : +33 1 6963 4723 Email: emmanuel.dotaro@alcatel.fr
9. Intellectual Property Considerations 9. Intellectual Property Considerations
The IETF takes no position regarding the validity or scope of any The IETF takes no position regarding the validity or scope of any
Intellectual Property Rights or other rights that might be claimed Intellectual Property Rights or other rights that might be claimed
to pertain to the implementation or use of the technology described to pertain to the implementation or use of the technology described
in this document or the extent to which any license under such in this document or the extent to which any license under such
rights might or might not be available; nor does it represent that rights might or might not be available; nor does it represent that
 End of changes. 37 change blocks. 
200 lines changed or deleted 242 lines changed or added

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