| 1 |
<pre>Internet Engineering Task Force (IETF) T. Takeda, Ed. |
| 2 |
Request for Comments: 6457 NTT |
| 3 |
Category: Informational A. Farrel |
| 4 |
ISSN: 2070-1721 Old Dog Consulting |
| 5 |
December 2011 |
| 6 |
|
| 7 |
|
| 8 |
<span class="h1">PCC-PCE Communication and PCE Discovery Requirements for</span> |
| 9 |
<span class="h1">Inter-Layer Traffic Engineering</span> |
| 10 |
|
| 11 |
Abstract |
| 12 |
|
| 13 |
The Path Computation Element (PCE) provides functions of path |
| 14 |
computation in support of traffic engineering in networks controlled |
| 15 |
by Multi-Protocol Label Switching (MPLS) and Generalized MPLS |
| 16 |
(GMPLS). |
| 17 |
|
| 18 |
MPLS and GMPLS networks may be constructed from layered client/server |
| 19 |
networks. It is advantageous for overall network efficiency to |
| 20 |
provide end-to-end traffic engineering across multiple network |
| 21 |
layers. PCE is a candidate solution for such requirements. |
| 22 |
|
| 23 |
Generic requirements for a communication protocol between Path |
| 24 |
Computation Clients (PCCs) and PCEs are presented in <a href="./rfc4657">RFC 4657</a>, "Path |
| 25 |
Computation Element (PCE) Communication Protocol Generic |
| 26 |
Requirements". Generic requirements for a PCE discovery protocol are |
| 27 |
presented in <a href="./rfc4674">RFC 4674</a>, "Requirements for Path Computation Element |
| 28 |
(PCE) Discovery". |
| 29 |
|
| 30 |
This document complements the generic requirements and presents |
| 31 |
detailed sets of PCC-PCE communication protocol requirements and PCE |
| 32 |
discovery protocol requirements for inter-layer traffic engineering. |
| 33 |
|
| 34 |
Status of This Memo |
| 35 |
|
| 36 |
This document is not an Internet Standards Track specification; it is |
| 37 |
published for informational purposes. |
| 38 |
|
| 39 |
This document is a product of the Internet Engineering Task Force |
| 40 |
(IETF). It represents the consensus of the IETF community. It has |
| 41 |
received public review and has been approved for publication by the |
| 42 |
Internet Engineering Steering Group (IESG). Not all documents |
| 43 |
approved by the IESG are a candidate for any level of Internet |
| 44 |
Standard; see <a href="./rfc5741#section-2">Section 2 of RFC 5741</a>. |
| 45 |
|
| 46 |
Information about the current status of this document, any errata, |
| 47 |
and how to provide feedback on it may be obtained at |
| 48 |
<a href="http://www.rfc-editor.org/info/rfc6457">http://www.rfc-editor.org/info/rfc6457</a>. |
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
|
| 53 |
|
| 54 |
|
| 55 |
|
| 56 |
|
| 57 |
|
| 58 |
<span class="grey">Takeda, et al. Informational [Page 1]</span></pre> |
| 59 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 60 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 61 |
|
| 62 |
|
| 63 |
Copyright Notice |
| 64 |
|
| 65 |
Copyright (c) 2011 IETF Trust and the persons identified as the |
| 66 |
document authors. All rights reserved. |
| 67 |
|
| 68 |
This document is subject to <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and the IETF Trust's Legal |
| 69 |
Provisions Relating to IETF Documents |
| 70 |
(<a href="http://trustee.ietf.org/license-info">http://trustee.ietf.org/license-info</a>) in effect on the date of |
| 71 |
publication of this document. Please review these documents |
| 72 |
carefully, as they describe your rights and restrictions with respect |
| 73 |
to this document. Code Components extracted from this document must |
| 74 |
include Simplified BSD License text as described in Section 4.e of |
| 75 |
the Trust Legal Provisions and are provided without warranty as |
| 76 |
described in the Simplified BSD License. |
| 77 |
|
| 78 |
Table of Contents |
| 79 |
|
| 80 |
<a href="#section-1">1</a>. Introduction ....................................................<a href="#page-2">2</a> |
| 81 |
<a href="#section-1.1">1.1</a>. Terminology ................................................<a href="#page-3">3</a> |
| 82 |
<a href="#section-2">2</a>. Motivation for PCE-Based Inter-Layer Path Computation ...........<a href="#page-4">4</a> |
| 83 |
3. PCC-PCE Communication and Discovery Requirements for |
| 84 |
Inter-Layer .....................................................<a href="#page-4">4</a> |
| 85 |
<a href="#section-3.1">3.1</a>. PCC-PCE Communication ......................................<a href="#page-5">5</a> |
| 86 |
<a href="#section-3.1.1">3.1.1</a>. Control of Inter-Layer Path Computation .............<a href="#page-5">5</a> |
| 87 |
<a href="#section-3.1.2">3.1.2</a>. Control of the Type of Path to Be Computed ..........<a href="#page-5">5</a> |
| 88 |
<a href="#section-3.1.3">3.1.3</a>. Communication of Inter-Layer Constraints ............<a href="#page-6">6</a> |
| 89 |
<a href="#section-3.1.4">3.1.4</a>. Adaptation Capability ...............................<a href="#page-7">7</a> |
| 90 |
<a href="#section-3.1.5">3.1.5</a>. Cooperation between PCEs ............................<a href="#page-7">7</a> |
| 91 |
<a href="#section-3.1.6">3.1.6</a>. Inter-Layer Diverse Paths ...........................<a href="#page-7">7</a> |
| 92 |
<a href="#section-3.2">3.2</a>. Capabilities Advertisements for PCE Discovery ..............<a href="#page-7">7</a> |
| 93 |
<a href="#section-3.3">3.3</a>. Supported Network Models ...................................<a href="#page-8">8</a> |
| 94 |
<a href="#section-4">4</a>. Manageability Considerations ....................................<a href="#page-8">8</a> |
| 95 |
<a href="#section-4.1">4.1</a>. Control of Function and Policy .............................<a href="#page-8">8</a> |
| 96 |
<a href="#section-4.2">4.2</a>. Information and Data Models ................................<a href="#page-8">8</a> |
| 97 |
<a href="#section-4.3">4.3</a>. Liveness Detection and Monitoring ..........................<a href="#page-8">8</a> |
| 98 |
<a href="#section-4.4">4.4</a>. Verifying Correct Operation ................................<a href="#page-9">9</a> |
| 99 |
<a href="#section-4.5">4.5</a>. Requirements on Other Protocols and Functional Components ..9 |
| 100 |
<a href="#section-4.6">4.6</a>. Impact on Network Operation ................................<a href="#page-9">9</a> |
| 101 |
<a href="#section-5">5</a>. Security Considerations ........................................<a href="#page-10">10</a> |
| 102 |
<a href="#section-6">6</a>. Acknowledgments ................................................<a href="#page-10">10</a> |
| 103 |
<a href="#section-7">7</a>. References .....................................................<a href="#page-10">10</a> |
| 104 |
<a href="#section-7.1">7.1</a>. Normative References ......................................<a href="#page-10">10</a> |
| 105 |
<a href="#section-7.2">7.2</a>. Informative References ....................................<a href="#page-10">10</a> |
| 106 |
|
| 107 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 108 |
|
| 109 |
The Path Computation Element (PCE) defined in [<a href="./rfc4655" title=""A Path Computation Element (PCE)-Based Architecture"">RFC4655</a>] is an entity |
| 110 |
that is capable of computing a network path or route based on a |
| 111 |
network graph and applying computational constraints. |
| 112 |
|
| 113 |
A network may comprise multiple layers. These layers may represent |
| 114 |
the separation of technologies (e.g., Packet Switch Capable (PSC), |
| 115 |
Time Division Multiplex (TDM), lambda switch capable (LSC)) into |
| 116 |
GMPLS regions [<a href="./rfc3945" title=""Generalized Multi-Protocol Label Switching (GMPLS) Architecture"">RFC3945</a>], the separation of data plane switching |
| 117 |
|
| 118 |
|
| 119 |
|
| 120 |
<span class="grey">Takeda, et al. Informational [Page 2]</span></pre> |
| 121 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 122 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 123 |
|
| 124 |
|
| 125 |
granularity levels (e.g., PSC-1 and PSC-2 or Virtual Circuit 4 (VC4) |
| 126 |
and VC12) into GMPLS layers [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>], or a distinction between |
| 127 |
client and server networking roles (e.g., commercial or |
| 128 |
administrative separation of client and server networks). In this |
| 129 |
multi-layer network, Label Switched Paths (LSPs) in lower layers are |
| 130 |
used to carry upper-layer LSPs. The network topology formed by |
| 131 |
lower-layer LSPs and advertised to the higher layer is called a |
| 132 |
"Virtual Network Topology (VNT)" [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>]. |
| 133 |
|
| 134 |
In layered networks under the operation of Multiprotocol Label |
| 135 |
Switching Traffic Engineering (MPLS-TE) and Generalized MPLS (GMPLS) |
| 136 |
protocols, it is important to provide mechanisms to allow global |
| 137 |
optimization of network resources. That is, to take into account all |
| 138 |
layers, rather than optimizing resource utilization at each layer |
| 139 |
independently. This allows better network efficiency to be achieved. |
| 140 |
This is what we call "inter-layer traffic engineering". This |
| 141 |
includes mechanisms allowing computation of end-to-end paths across |
| 142 |
layers (known as "inter-layer path computation") and mechanisms for |
| 143 |
control and management of the VNT by setting up and releasing LSPs in |
| 144 |
the lower layers [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>]. |
| 145 |
|
| 146 |
Inter-layer traffic engineering is included in the scope of the PCE |
| 147 |
architecture [<a href="./rfc4655" title=""A Path Computation Element (PCE)-Based Architecture"">RFC4655</a>], and PCE can provide a suitable mechanism for |
| 148 |
resolving inter-layer path computation issues. The applicability of |
| 149 |
the PCE-based path computation architecture to inter-layer traffic |
| 150 |
engineering is described in [<a href="./rfc5623" title=""Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering"">RFC5623</a>]. |
| 151 |
|
| 152 |
This document presents sets of requirements for communication between |
| 153 |
Path Computation Clients (PCCs) and PCEs using the PCE Communication |
| 154 |
Protocol (PCEP) and for PCE discovery for inter-layer traffic |
| 155 |
engineering. It supplements the generic requirements documented in |
| 156 |
[<a href="./rfc4657" title=""Path Computation Element (PCE) Communication Protocol Generic Requirements"">RFC4657</a>], [<a href="./rfc4674" title=""Requirements for Path Computation Element (PCE) Discovery"">RFC4674</a>], and the framework provided in [<a href="./rfc5623" title=""Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering"">RFC5623</a>]. |
| 157 |
|
| 158 |
<span class="h3"><a class="selflink" id="section-1.1" href="#section-1.1">1.1</a>. Terminology</span> |
| 159 |
|
| 160 |
LSP: Label Switched Path. |
| 161 |
|
| 162 |
LSR: Label Switching Router. |
| 163 |
|
| 164 |
PCC: A Path Computation Client is any client entity (component, |
| 165 |
application or network node) requesting a path computation to |
| 166 |
be performed by a Path Computation Element. |
| 167 |
|
| 168 |
PCE: A Path Computation Element is an entity that is capable of |
| 169 |
computing a network path or route based on a network graph and |
| 170 |
applying computational constraints. |
| 171 |
|
| 172 |
PCEP: A PCE Communication Protocol is a protocol for communication |
| 173 |
between PCCs and PCEs. |
| 174 |
|
| 175 |
|
| 176 |
|
| 177 |
|
| 178 |
|
| 179 |
|
| 180 |
|
| 181 |
|
| 182 |
<span class="grey">Takeda, et al. Informational [Page 3]</span></pre> |
| 183 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 184 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 185 |
|
| 186 |
|
| 187 |
Although this requirements document is informational and not a |
| 188 |
protocol specification, the key words "MUST", "MUST NOT", "REQUIRED", |
| 189 |
"SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", |
| 190 |
and "OPTIONAL" are to be interpreted as described in <a href="./rfc2119">RFC 2119</a> |
| 191 |
[<a href="./rfc2119" title=""Key words for use in RFCs to Indicate Requirement Levels"">RFC2119</a>] for clarity of requirement specification. |
| 192 |
|
| 193 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Motivation for PCE-Based Inter-Layer Path Computation</span> |
| 194 |
|
| 195 |
[<a id="ref-RFC4206">RFC4206</a>] defines a way to signal an MPLS or a GMPLS LSP with an |
| 196 |
explicit route in a higher layer of a network that includes hops |
| 197 |
traversed by LSPs in lower layers of the network. The computation of |
| 198 |
end-to-end paths across layers is called "inter-layer path |
| 199 |
computation". |
| 200 |
|
| 201 |
An LSR in the higher layer might not have information on the topology |
| 202 |
of lower layers, particularly in an overlay or augmented model; |
| 203 |
hence, it might not be able to compute an end-to-end path across |
| 204 |
layers. |
| 205 |
|
| 206 |
PCE-based inter-layer path computation consists of relying on one or |
| 207 |
more PCEs to compute an end-to-end path across layers. This could |
| 208 |
rely on a single PCE path computation where the PCE has topology |
| 209 |
information about multiple layers and can directly compute an end-to- |
| 210 |
end path across layers considering the topology of all of the layers. |
| 211 |
Alternatively, the inter-layer path computation could be performed as |
| 212 |
a multiple PCE computation, where each member of a set of PCEs has |
| 213 |
information about the topology of one or more layers, but not all |
| 214 |
layers, and they collaborate to compute an end-to-end path. |
| 215 |
|
| 216 |
Consider a two-layer network where the higher-layer network is a |
| 217 |
packet-based IP/MPLS or GMPLS network and the lower-layer network is |
| 218 |
a GMPLS-controlled optical network. An ingress LSR in the higher- |
| 219 |
layer network tries to set up an LSP to an egress LSR also in the |
| 220 |
higher-layer network across the lower-layer network, and it needs a |
| 221 |
path in the higher-layer network. However, suppose that there is no |
| 222 |
TE link between border LSRs, which are located on the boundary |
| 223 |
between the higher-layer and lower-layer networks, and that the |
| 224 |
ingress LSR does not have topology visibility in the lower layer. If |
| 225 |
a single-layer path computation is applied for the higher layer, the |
| 226 |
path computation fails. On the other hand, inter-layer path |
| 227 |
computation is able to provide a route in the higher layer and a |
| 228 |
suggestion that a lower-layer LSP be set up between border LSRs, |
| 229 |
considering both layers as TE topologies. |
| 230 |
|
| 231 |
Further discussion of the application of PCE to inter-layer path |
| 232 |
computation can be found in [<a href="./rfc5623" title=""Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering"">RFC5623</a>]. |
| 233 |
|
| 234 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. PCC-PCE Communication and Discovery Requirements for Inter-Layer</span> |
| 235 |
<span class="h2"> Traffic Engineering</span> |
| 236 |
|
| 237 |
This section provides additional requirements specific to the |
| 238 |
problems of multi-layer TE that are not covered in [<a href="./rfc4657" title=""Path Computation Element (PCE) Communication Protocol Generic Requirements"">RFC4657</a>] or |
| 239 |
[<a href="./rfc4674" title=""Requirements for Path Computation Element (PCE) Discovery"">RFC4674</a>]. |
| 240 |
|
| 241 |
|
| 242 |
|
| 243 |
|
| 244 |
<span class="grey">Takeda, et al. Informational [Page 4]</span></pre> |
| 245 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 246 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 247 |
|
| 248 |
|
| 249 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. PCC-PCE Communication</span> |
| 250 |
|
| 251 |
PCEP MUST allow requests and replies for inter-layer path |
| 252 |
computation. |
| 253 |
|
| 254 |
This requires no additional messages, but it implies the following |
| 255 |
additional constraints to be added to PCEP. |
| 256 |
|
| 257 |
<span class="h4"><a class="selflink" id="section-3.1.1" href="#section-3.1.1">3.1.1</a>. Control of Inter-Layer Path Computation</span> |
| 258 |
|
| 259 |
A request from a PCC to a PCE MUST support the inclusion of an |
| 260 |
optional indication of whether inter-layer path computation is |
| 261 |
allowed. In the absence of such an indication, the default is that |
| 262 |
inter-layer path computation is not allowed. |
| 263 |
|
| 264 |
<span class="h4"><a class="selflink" id="section-3.1.2" href="#section-3.1.2">3.1.2</a>. Control of the Type of Path to Be Computed</span> |
| 265 |
|
| 266 |
The PCE computes and returns a path to the PCC that the PCC can use |
| 267 |
to build a higher-layer or lower-layer LSP once converted to an |
| 268 |
Explicit Route Object (ERO) for use in RSVP - Traffic Engineering |
| 269 |
(RSVP-TE) signaling. There are two options [<a href="./rfc5623" title=""Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering"">RFC5623</a>]. |
| 270 |
|
| 271 |
- Option 1: Mono-Layer Path. The PCE computes a "mono-layer" path, |
| 272 |
i.e., a path that includes only TE links from the same layer. |
| 273 |
|
| 274 |
- Option 2: Multi-Layer Path. The PCE computes a "multi-layer" |
| 275 |
path, i.e., a path that includes TE links from distinct layers |
| 276 |
[<a href="./rfc4206" title=""Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE)"">RFC4206</a>]. |
| 277 |
|
| 278 |
It may be necessary or desirable for a PCC to control the type of |
| 279 |
path that is produced by a PCE. For example, a PCC may know that it |
| 280 |
is not possible, for technological or policy reasons, to signal a |
| 281 |
multi-layer path and that a mono-layer path is required, or the PCC |
| 282 |
may know that it does not wish the layer border node to have control |
| 283 |
of path computation. In order to make this level of control |
| 284 |
possible, PCEP MUST allow the PCC to select the path types to be |
| 285 |
computed, and that may be returned, by choosing one or more from the |
| 286 |
following list: |
| 287 |
|
| 288 |
- A mono-layer path that is specified by strict hop(s). The path |
| 289 |
may include virtual TE link(s). |
| 290 |
|
| 291 |
- A mono-layer path that includes loose hop(s). |
| 292 |
|
| 293 |
- A multi-layer path that can include the path (as strict or loose |
| 294 |
hops) of one or more lower-layer LSPs not yet established. |
| 295 |
|
| 296 |
The path computation response from a PCE to a PCC MUST report the |
| 297 |
type of path computed, and where a multi-layer path is returned, PCEP |
| 298 |
MUST support the inclusion, as part of end-to-end path, of the path |
| 299 |
of the lower-layer LSPs to be established. |
| 300 |
|
| 301 |
|
| 302 |
|
| 303 |
|
| 304 |
|
| 305 |
|
| 306 |
<span class="grey">Takeda, et al. Informational [Page 5]</span></pre> |
| 307 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 308 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 309 |
|
| 310 |
|
| 311 |
If a response message from a PCE to PCC carries a mono-layer path |
| 312 |
that is specified by strict hops but includes virtual TE link(s), |
| 313 |
includes loose hop(s), or carries a multi-layer path that can include |
| 314 |
the complete path of one or more lower-layer LSPs not yet |
| 315 |
established, the signaling of the higher-layer LSP may trigger the |
| 316 |
establishment of the lower-layer LSPs (triggered signaling). The |
| 317 |
triggered signaling may increase the higher-layer connection setup |
| 318 |
latency. An ingress LSR for the higher-layer LSP, or a PCC, needs to |
| 319 |
know whether or not triggered signaling is required. |
| 320 |
|
| 321 |
A request from a PCC to a PCE MUST allow indicating whether or not |
| 322 |
triggered signaling is acceptable. |
| 323 |
|
| 324 |
A response from a PCE to a PCC MUST allow indicating whether or not |
| 325 |
the computed path requires triggered signaling. |
| 326 |
|
| 327 |
Note that a PCE may not be able to distinguish virtual TE links from |
| 328 |
regular TE links. In such cases, even if a request from a PCC to a |
| 329 |
PCE indicates that triggered signaling is not acceptable, a PCE may |
| 330 |
choose virtual TE links in path computation. Therefore, when a |
| 331 |
network uses virtual TE links and a PCE is not able to distinguish |
| 332 |
virtual TE links from regular TE links, a PCE MAY choose virtual TE |
| 333 |
links even if a request from a PCC to a PCE indicates triggered |
| 334 |
signaling is not acceptable. |
| 335 |
|
| 336 |
Also, note that an ingress LSR of a higher-layer or lower-layer LSP |
| 337 |
may be present in multiple layers. Thus, even when a mono-layer path |
| 338 |
is requested or supplied, PCEP MUST be able to indicate the |
| 339 |
required/provided path layer. |
| 340 |
|
| 341 |
<span class="h4"><a class="selflink" id="section-3.1.3" href="#section-3.1.3">3.1.3</a>. Communication of Inter-Layer Constraints</span> |
| 342 |
|
| 343 |
A request from a PCC to a PCE MUST support the inclusion of |
| 344 |
constraints for a multi-layer path. This includes control over which |
| 345 |
network layers may, must, or must not be included in the computed |
| 346 |
path. Such control may be expressed in terms of the switching types |
| 347 |
of the layer networks. |
| 348 |
|
| 349 |
Furthermore, it may be desirable to constrain the number of layer |
| 350 |
boundaries crossed (i.e., the number of adaptations in the sense used |
| 351 |
in [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>] performed on the end-to-end path), so PCEP SHOULD |
| 352 |
include a constraint or objective function to minimize or cap the |
| 353 |
number of adaptations on a path and a mechanism to report that number |
| 354 |
when a path is supplied. |
| 355 |
|
| 356 |
The path computation request MUST also allow for different objective |
| 357 |
functions to be applied within different network layers. For |
| 358 |
example, the path in a packet-network may need to be optimized for |
| 359 |
least delay using the IGP metric as a measure of delay, while the |
| 360 |
path in an underlying TDM network might be optimized for fewest hops. |
| 361 |
|
| 362 |
|
| 363 |
|
| 364 |
|
| 365 |
|
| 366 |
|
| 367 |
|
| 368 |
<span class="grey">Takeda, et al. Informational [Page 6]</span></pre> |
| 369 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 370 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 371 |
|
| 372 |
|
| 373 |
<span class="h4"><a class="selflink" id="section-3.1.4" href="#section-3.1.4">3.1.4</a>. Adaptation Capability</span> |
| 374 |
|
| 375 |
The concept of adaptation is used here as introduced in [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>]. |
| 376 |
|
| 377 |
It MUST be possible for the path computation request to indicate the |
| 378 |
desired adaptation function at the end points of the lower-layer LSP |
| 379 |
that is being computed. This will be particularly important where |
| 380 |
the ingress and egress LSR participate in more than one layer network |
| 381 |
but may not be capable of all associated adaptations. |
| 382 |
|
| 383 |
<span class="h4"><a class="selflink" id="section-3.1.5" href="#section-3.1.5">3.1.5</a>. Cooperation between PCEs</span> |
| 384 |
|
| 385 |
When each layer is in scope of a different PCE, which only has access |
| 386 |
to the topology information of its layer, the PCEs of each layer need |
| 387 |
to cooperate to perform inter-layer path computation. In this case, |
| 388 |
communication between PCEs is required for inter-layer path |
| 389 |
computation. A PCE that behaves as a client is defined as a PCC |
| 390 |
[<a href="./rfc4655" title=""A Path Computation Element (PCE)-Based Architecture"">RFC4655</a>]. |
| 391 |
|
| 392 |
PCEP MUST allow requests and replies for multiple PCE inter-layer |
| 393 |
path computation. |
| 394 |
|
| 395 |
<span class="h4"><a class="selflink" id="section-3.1.6" href="#section-3.1.6">3.1.6</a>. Inter-Layer Diverse Paths</span> |
| 396 |
|
| 397 |
PCEP MUST allow for the computation of diverse inter-layer paths. A |
| 398 |
request from a PCC to a PCE MUST support the inclusion of multiple |
| 399 |
path requests, with the desired level of diversity at each layer |
| 400 |
(link, node, Shared Risk Link Group (SRLG)). |
| 401 |
|
| 402 |
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Capabilities Advertisements for PCE Discovery</span> |
| 403 |
|
| 404 |
In the case where there are several PCEs with distinct capabilities |
| 405 |
available, a PCC has to select one or more appropriate PCEs. For |
| 406 |
that purpose, the PCE discovery mechanism MAY support the disclosure |
| 407 |
of some detailed PCE capabilities. A PCE MAY (to be consistent with |
| 408 |
the above text and <a href="./rfc4674">RFC 4674</a>) be able to advise the following PCE |
| 409 |
capabilities related to inter-layer path computation: |
| 410 |
|
| 411 |
- Support for inter-layer path computation |
| 412 |
|
| 413 |
- Support for mono-layer/multi-layer paths |
| 414 |
|
| 415 |
- Support for inter-layer constraints |
| 416 |
|
| 417 |
- Support for adaptation capability |
| 418 |
|
| 419 |
- Support for inter-PCE communication |
| 420 |
|
| 421 |
- Support for inter-layer diverse path computation |
| 422 |
|
| 423 |
|
| 424 |
|
| 425 |
|
| 426 |
|
| 427 |
|
| 428 |
|
| 429 |
|
| 430 |
<span class="grey">Takeda, et al. Informational [Page 7]</span></pre> |
| 431 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 432 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 433 |
|
| 434 |
|
| 435 |
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>. Supported Network Models</span> |
| 436 |
|
| 437 |
PCEP SHOULD allow several architectural alternatives for interworking |
| 438 |
between MPLS- and GMPLS-controlled networks: overlay, integrated, and |
| 439 |
augmented models [<a href="./rfc3945" title=""Generalized Multi-Protocol Label Switching (GMPLS) Architecture"">RFC3945</a>] [<a href="./rfc5145" title=""Framework for MPLS-TE to GMPLS Migration"">RFC5145</a>] [<a href="./rfc5146" title=""Interworking Requirements to Support Operation of MPLS-TE over GMPLS Networks"">RFC5146</a>]. |
| 440 |
|
| 441 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Manageability Considerations</span> |
| 442 |
|
| 443 |
<span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a>. Control of Function and Policy</span> |
| 444 |
|
| 445 |
An individual PCE MAY elect to support inter-layer computations and |
| 446 |
advertise its capabilities as described in the previous sections. |
| 447 |
PCE implementations MAY provide a configuration switch to allow |
| 448 |
support of inter-layer path computations to be enabled or disabled. |
| 449 |
When the level of support is changed, this SHOULD be re-advertised. |
| 450 |
|
| 451 |
However, a PCE MAY also elect to support inter-layer computations, |
| 452 |
but not to advertise the fact, so that only those PCCs configured to |
| 453 |
know of the PCE and its capabilities can use it. |
| 454 |
|
| 455 |
Support for, and advertisement of support for, inter-layer path |
| 456 |
computation MAY be subject to policy and a PCE MAY hide its inter- |
| 457 |
layer capabilities from certain PCCs by not advertising them through |
| 458 |
the discovery protocol and not reporting them to the specific PCCs in |
| 459 |
any PCEP capabilities exchange. Further, a PCE MAY be directed by |
| 460 |
policy to refuse an inter-layer path computation request for any |
| 461 |
reason including, but not limited to, the identity of the PCC that |
| 462 |
makes the request. |
| 463 |
|
| 464 |
A further discussion of policy-enabled path computation can be found |
| 465 |
in [<a href="./rfc5394" title=""Policy-Enabled Path Computation Framework"">RFC5394</a>]. |
| 466 |
|
| 467 |
<span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a>. Information and Data Models</span> |
| 468 |
|
| 469 |
PCEP extensions to support inter-layer computations MUST be |
| 470 |
accompanied by MIB objects for the control and monitoring of the |
| 471 |
protocol and of the PCE that performs the computations. The MIB |
| 472 |
objects MAY be provided in the same MIB module as used for general |
| 473 |
PCEP control and monitoring [<a href="#ref-PCEP-MIB" title=""PCE communication protocol (PCEP) Management Information Base"">PCEP-MIB</a>] or MAY be provided in a new |
| 474 |
MIB module. |
| 475 |
|
| 476 |
The MIB objects MUST provide the ability to control and monitor all |
| 477 |
aspects of PCEP relevant to inter-layer path computation. |
| 478 |
|
| 479 |
<span class="h3"><a class="selflink" id="section-4.3" href="#section-4.3">4.3</a>. Liveness Detection and Monitoring</span> |
| 480 |
|
| 481 |
No changes are necessary to the liveness detection and monitoring |
| 482 |
requirements as already embodied in [<a href="./rfc4657" title=""Path Computation Element (PCE) Communication Protocol Generic Requirements"">RFC4657</a>]. It should be noted, |
| 483 |
however, that inter-layer path computations might require extended |
| 484 |
cooperation between PCEs (as is also the case for inter-AS |
| 485 |
(Autonomous System) and inter-area computations), and so the liveness |
| 486 |
detection and monitoring SHOULD be applied to each PCEP communication |
| 487 |
and aggregated to report the behavior of an individual PCEP request |
| 488 |
to the originating PCC. |
| 489 |
|
| 490 |
|
| 491 |
|
| 492 |
<span class="grey">Takeda, et al. Informational [Page 8]</span></pre> |
| 493 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 494 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 495 |
|
| 496 |
|
| 497 |
In particular, where a request is forwarded between multiple PCEs, |
| 498 |
neither the PCC nor the first PCE can monitor the liveness of all |
| 499 |
PCE-PCE connections or of the PCEs themselves. In this case, |
| 500 |
suitable performance of the original PCEP request relies on each PCE |
| 501 |
operating correct monitoring procedures and correlating any failures |
| 502 |
back to the PCEP requests that are outstanding. These requirements |
| 503 |
are no different from those for any cooperative PCE usage, and they |
| 504 |
are expected already to be covered by general, and by inter-AS and |
| 505 |
inter-area, implementations. Such a procedure is specified in |
| 506 |
[<a href="./rfc5441" title=""A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths"">RFC5441</a>]. In addition, [<a href="./rfc5886" title=""A Set of Monitoring Tools for Path Computation Element (PCE)-Based Architecture"">RFC5886</a>] specifies mechanisms to gather |
| 507 |
various state metrics along the path computation chain. |
| 508 |
|
| 509 |
<span class="h3"><a class="selflink" id="section-4.4" href="#section-4.4">4.4</a>. Verifying Correct Operation</span> |
| 510 |
|
| 511 |
There are no additional requirements beyond those expressed in |
| 512 |
[<a href="./rfc4657" title=""Path Computation Element (PCE) Communication Protocol Generic Requirements"">RFC4657</a>] for verifying the correct operation of the PCEP. Note that |
| 513 |
verification of the correct operation of the PCE and its algorithms |
| 514 |
is out of scope for the protocol requirements, but a PCC MAY send the |
| 515 |
same request to more than one PCE and compare the results. |
| 516 |
|
| 517 |
<span class="h3"><a class="selflink" id="section-4.5" href="#section-4.5">4.5</a>. Requirements on Other Protocols and Functional Components</span> |
| 518 |
|
| 519 |
A PCE operates on a topology graph that may be built using |
| 520 |
information distributed by TE extensions to the routing protocol |
| 521 |
operating within the network. In order that the PCE can select a |
| 522 |
suitable path for the signaling protocol to use to install the inter- |
| 523 |
layer LSP, the topology graph must include information about the |
| 524 |
inter-layer signaling and forwarding (i.e., adaptation) capabilities |
| 525 |
of each LSR in the network. |
| 526 |
|
| 527 |
Whatever means are used to collect the information to build the |
| 528 |
topology graph, the graph MUST include the requisite information. If |
| 529 |
the TE extensions to the routing protocol are used, these SHOULD |
| 530 |
satisfy the requirements as described in [<a href="./rfc5212" title=""Requirements for GMPLS-Based Multi- Region and Multi-Layer Networks (MRN/MLN)"">RFC5212</a>]. |
| 531 |
|
| 532 |
<span class="h3"><a class="selflink" id="section-4.6" href="#section-4.6">4.6</a>. Impact on Network Operation</span> |
| 533 |
|
| 534 |
This section examines the impact on network operations of the use of |
| 535 |
a PCE for inter-layer traffic engineering. It does not present any |
| 536 |
further requirements on the PCE or PCC, for the PCEP or for |
| 537 |
deployment. |
| 538 |
|
| 539 |
The use of a PCE to compute inter-layer paths is not expected to have |
| 540 |
significant impact on network operations if the upper-layer traffic |
| 541 |
engineering practices are aware of the frequent changes that might |
| 542 |
occur in the VNT. It should also be noted that the introduction of |
| 543 |
inter-layer support to a PCE that already provides mono-layer path |
| 544 |
computation might change the loading of the PCE and that might have |
| 545 |
an impact on the network behavior especially during recovery periods |
| 546 |
immediately after a network failure. |
| 547 |
|
| 548 |
|
| 549 |
|
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
<span class="grey">Takeda, et al. Informational [Page 9]</span></pre> |
| 555 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 556 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 557 |
|
| 558 |
|
| 559 |
On the other hand, it is envisioned that the use of inter-layer path |
| 560 |
computation will have significant benefits to the operation of a |
| 561 |
multi-layer network including improving the network resource usage |
| 562 |
and enabling a greater number of higher-layer LSPs to be supported. |
| 563 |
|
| 564 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Security Considerations</span> |
| 565 |
|
| 566 |
Inter-layer traffic engineering with PCE may raise new security |
| 567 |
issues when PCE-PCE communication is used between different layer |
| 568 |
networks for inter-layer path computation. Security issues may also |
| 569 |
exist when a single PCE is granted full visibility of TE information |
| 570 |
that applies to multiple layers. |
| 571 |
|
| 572 |
The formal introduction of a VNT Manager component, as described in |
| 573 |
[<a href="./rfc5623" title=""Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering"">RFC5623</a>], provides the basis for the application of inter-layer |
| 574 |
security and policy. |
| 575 |
|
| 576 |
It is expected that solutions for inter-layer protocol extensions |
| 577 |
will address these issues in detail. |
| 578 |
|
| 579 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Acknowledgments</span> |
| 580 |
|
| 581 |
We would like to thank Kohei Shiomoto, Ichiro Inoue, Dean Cheng, |
| 582 |
Meral Shirazipour, Julien Meuric, and Stewart Bryant for their useful |
| 583 |
comments. Thanks to members of ITU-T Study Group 15, Question 14 for |
| 584 |
their constructive comments during the liaison process. |
| 585 |
|
| 586 |
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. References</span> |
| 587 |
|
| 588 |
<span class="h3"><a class="selflink" id="section-7.1" href="#section-7.1">7.1</a>. Normative References</span> |
| 589 |
|
| 590 |
[<a id="ref-RFC2119">RFC2119</a>] Bradner, S., "Key words for use in RFCs to Indicate |
| 591 |
Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>, March 1997. |
| 592 |
|
| 593 |
[<a id="ref-RFC3945">RFC3945</a>] Mannie, E., Ed., "Generalized Multi-Protocol Label |
| 594 |
Switching (GMPLS) Architecture", <a href="./rfc3945">RFC 3945</a>, October 2004. |
| 595 |
|
| 596 |
[<a id="ref-RFC4206">RFC4206</a>] Kompella, K. and Y. Rekhter, "Label Switched Paths (LSP) |
| 597 |
Hierarchy with Generalized Multi-Protocol Label Switching |
| 598 |
(GMPLS) Traffic Engineering (TE)", <a href="./rfc4206">RFC 4206</a>, October |
| 599 |
2005. |
| 600 |
|
| 601 |
<span class="h3"><a class="selflink" id="section-7.2" href="#section-7.2">7.2</a>. Informative References</span> |
| 602 |
|
| 603 |
[<a id="ref-RFC4655">RFC4655</a>] Farrel, A., Vasseur, J.-P., and J. Ash, "A Path |
| 604 |
Computation Element (PCE)-Based Architecture", <a href="./rfc4655">RFC 4655</a>, |
| 605 |
August 2006. |
| 606 |
|
| 607 |
[<a id="ref-RFC4657">RFC4657</a>] Ash, J., Ed., and J. Le Roux, Ed., "Path Computation |
| 608 |
Element (PCE) Communication Protocol Generic |
| 609 |
Requirements", <a href="./rfc4657">RFC 4657</a>, September 2006. |
| 610 |
|
| 611 |
[<a id="ref-RFC4674">RFC4674</a>] Le Roux, J., Ed., "Requirements for Path Computation |
| 612 |
Element (PCE) Discovery", <a href="./rfc4674">RFC 4674</a>, October 2006. |
| 613 |
|
| 614 |
|
| 615 |
|
| 616 |
<span class="grey">Takeda, et al. Informational [Page 10]</span></pre> |
| 617 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 618 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 619 |
|
| 620 |
|
| 621 |
[<a id="ref-RFC5145">RFC5145</a>] Shiomoto, K., Ed., "Framework for MPLS-TE to GMPLS |
| 622 |
Migration", <a href="./rfc5145">RFC 5145</a>, March 2008. |
| 623 |
|
| 624 |
[<a id="ref-RFC5146">RFC5146</a>] Kumaki, K., Ed., "Interworking Requirements to Support |
| 625 |
Operation of MPLS-TE over GMPLS Networks", <a href="./rfc5146">RFC 5146</a>, |
| 626 |
March 2008. |
| 627 |
|
| 628 |
[<a id="ref-RFC5212">RFC5212</a>] Shiomoto, K., Papadimitriou, D., Le Roux, JL., Vigoureux, |
| 629 |
M., and D. Brungard, "Requirements for GMPLS-Based Multi- |
| 630 |
Region and Multi-Layer Networks (MRN/MLN)", <a href="./rfc5212">RFC 5212</a>, |
| 631 |
July 2008. |
| 632 |
|
| 633 |
[<a id="ref-RFC5394">RFC5394</a>] Bryskin, I., Papadimitriou, D., Berger, L., and J. Ash, |
| 634 |
"Policy-Enabled Path Computation Framework", <a href="./rfc5394">RFC 5394</a>, |
| 635 |
December 2008. |
| 636 |
|
| 637 |
[<a id="ref-RFC5623">RFC5623</a>] Oki, E., Takeda, T., Le Roux, JL., and A. Farrel, |
| 638 |
"Framework for PCE-Based Inter-Layer MPLS and GMPLS |
| 639 |
Traffic Engineering", <a href="./rfc5623">RFC 5623</a>, September 2009. |
| 640 |
|
| 641 |
[<a id="ref-PCEP-MIB">PCEP-MIB</a>] A. Koushik, and E. Stephan, "PCE communication protocol |
| 642 |
(PCEP) Management Information Base", Work in Progress, |
| 643 |
July 2010. |
| 644 |
|
| 645 |
[<a id="ref-RFC5441">RFC5441</a>] Vasseur, JP., Ed., Zhang, R., Bitar, N., and JL. Le Roux, |
| 646 |
"A Backward-Recursive PCE-Based Computation (BRPC) |
| 647 |
Procedure to Compute Shortest Constrained Inter-Domain |
| 648 |
Traffic Engineering Label Switched Paths", <a href="./rfc5441">RFC 5441</a>, |
| 649 |
April 2009. |
| 650 |
|
| 651 |
[<a id="ref-RFC5886">RFC5886</a>] Vasseur, JP., Ed., Le Roux, JL., and Y. Ikejiri, "A Set |
| 652 |
of Monitoring Tools for Path Computation Element |
| 653 |
(PCE)-Based Architecture", <a href="./rfc5886">RFC 5886</a>, June 2010. |
| 654 |
|
| 655 |
|
| 656 |
|
| 657 |
|
| 658 |
|
| 659 |
|
| 660 |
|
| 661 |
|
| 662 |
|
| 663 |
|
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
|
| 669 |
|
| 670 |
|
| 671 |
|
| 672 |
|
| 673 |
|
| 674 |
|
| 675 |
|
| 676 |
|
| 677 |
|
| 678 |
<span class="grey">Takeda, et al. Informational [Page 11]</span></pre> |
| 679 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 680 |
<span class="grey"><a href="./rfc6457">RFC 6457</a> PCE Inter-Layer Requirements December 2011</span> |
| 681 |
|
| 682 |
|
| 683 |
Contributing Authors |
| 684 |
|
| 685 |
Eiji Oki |
| 686 |
University of Electro-Communications |
| 687 |
Tokyo, Japan |
| 688 |
EMail: [email protected] |
| 689 |
|
| 690 |
|
| 691 |
Jean-Louis Le Roux |
| 692 |
France Telecom R&D, |
| 693 |
Av Pierre Marzin, |
| 694 |
22300 Lannion, France |
| 695 |
EMail: [email protected] |
| 696 |
|
| 697 |
|
| 698 |
Kenji Kumaki |
| 699 |
KDDI Corporation |
| 700 |
Garden Air Tower |
| 701 |
Iidabashi, Chiyoda-ku, |
| 702 |
Tokyo 102-8460, JAPAN |
| 703 |
EMail: [email protected] |
| 704 |
|
| 705 |
Authors' Addresses |
| 706 |
|
| 707 |
Tomonori Takeda (editor) |
| 708 |
NTT |
| 709 |
3-9-11 Midori-cho, |
| 710 |
Musashino-shi, Tokyo 180-8585, Japan |
| 711 |
EMail: [email protected] |
| 712 |
|
| 713 |
|
| 714 |
Adrian Farrel |
| 715 |
Old Dog Consulting |
| 716 |
EMail: [email protected] |
| 717 |
|
| 718 |
|
| 719 |
|
| 720 |
|
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
|
| 725 |
|
| 726 |
|
| 727 |
|
| 728 |
|
| 729 |
|
| 730 |
|
| 731 |
|
| 732 |
|
| 733 |
|
| 734 |
|
| 735 |
|
| 736 |
|
| 737 |
|
| 738 |
|
| 739 |
|
| 740 |
Takeda, et al. Informational [Page 12] |
| 741 |
</pre> |