| 1 |
<pre>Network Working Group B. Jamoussi, Editor, Nortel Networks |
| 2 |
Request for Comments: 3212 L. Andersson, Utfors AB |
| 3 |
Category: Standards Track R. Callon, Juniper Networks |
| 4 |
R. Dantu, Netrake Corporation |
| 5 |
L. Wu, Cisco Systems |
| 6 |
P. Doolan, OTB Consulting Corp. |
| 7 |
T. Worster |
| 8 |
N. Feldman, IBM Corp. |
| 9 |
A. Fredette, ANF Consulting |
| 10 |
M. Girish, Atoga Systems |
| 11 |
E. Gray, Sandburst |
| 12 |
J. Heinanen, Song Networks, Inc. |
| 13 |
T. Kilty, Newbridge Networks, Inc. |
| 14 |
A. Malis, Vivace Networks |
| 15 |
January 2002 |
| 16 |
|
| 17 |
|
| 18 |
<span class="h1">Constraint-Based LSP Setup using LDP</span> |
| 19 |
|
| 20 |
Status of this Memo |
| 21 |
|
| 22 |
This document specifies an Internet standards track protocol for the |
| 23 |
Internet community, and requests discussion and suggestions for |
| 24 |
improvements. Please refer to the current edition of the "Internet |
| 25 |
Official Protocol Standards" (STD 1) for the standardization state |
| 26 |
and status of this protocol. Distribution of this memo is unlimited. |
| 27 |
|
| 28 |
Copyright Notice |
| 29 |
|
| 30 |
Copyright (C) The Internet Society (2002). All Rights Reserved. |
| 31 |
|
| 32 |
Abstract |
| 33 |
|
| 34 |
This document specifies mechanisms and TLVs (Type/Length/Value) for |
| 35 |
support of CR-LSPs (constraint-based routed Label Switched Path) |
| 36 |
using LDP (Label Distribution Protocol). |
| 37 |
|
| 38 |
This specification proposes an end-to-end setup mechanism of a CR-LSP |
| 39 |
initiated by the ingress LSR (Label Switching Router). We also |
| 40 |
specify mechanisms to provide means for reservation of resources |
| 41 |
using LDP. |
| 42 |
|
| 43 |
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", |
| 44 |
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this |
| 45 |
document are to be interpreted as described in <a href="./rfc2119">RFC 2119</a> [<a href="#ref-6" title=""Key words for use in RFCs to Indicate Requirement Levels"">6</a>]. |
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Jamoussi, et al. Standards Track [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 55 |
|
| 56 |
|
| 57 |
Table of Contents |
| 58 |
|
| 59 |
<a href="#section-1">1</a>. Introduction....................................................<a href="#page-3">3</a> |
| 60 |
<a href="#section-2">2</a>. Constraint-based Routing Overview...............................<a href="#page-4">4</a> |
| 61 |
<a href="#section-2.1">2.1</a> Strict and Loose Explicit Routes...............................<a href="#page-5">5</a> |
| 62 |
<a href="#section-2.2">2.2</a> Traffic Characteristics........................................<a href="#page-5">5</a> |
| 63 |
<a href="#section-2.3">2.3</a> Preemption.....................................................<a href="#page-5">5</a> |
| 64 |
<a href="#section-2.4">2.4</a> Route Pinning..................................................<a href="#page-6">6</a> |
| 65 |
<a href="#section-2.5">2.5</a> Resource Class.................................................<a href="#page-6">6</a> |
| 66 |
<a href="#section-3">3</a>. Solution Overview...............................................<a href="#page-6">6</a> |
| 67 |
<a href="#section-3.1">3.1</a> Required Messages and TLVs.....................................<a href="#page-7">7</a> |
| 68 |
<a href="#section-3.2">3.2</a> Label Request Message..........................................<a href="#page-7">7</a> |
| 69 |
<a href="#section-3.3">3.3</a> Label Mapping Message..........................................<a href="#page-9">9</a> |
| 70 |
<a href="#section-3.4">3.4</a> Notification Message..........................................<a href="#page-10">10</a> |
| 71 |
<a href="#section-3.5">3.5</a> Release , Withdraw, and Abort Messages........................<a href="#page-11">11</a> |
| 72 |
<a href="#section-4">4</a>. Protocol Specification.........................................<a href="#page-11">11</a> |
| 73 |
<a href="#section-4.1">4.1</a> Explicit Route TLV (ER-TLV)...................................<a href="#page-11">11</a> |
| 74 |
<a href="#section-4.2">4.2</a> Explicit Route Hop TLV (ER-Hop TLV)...........................<a href="#page-12">12</a> |
| 75 |
<a href="#section-4.3">4.3</a> Traffic Parameters TLV........................................<a href="#page-13">13</a> |
| 76 |
<a href="#section-4.3.1">4.3.1</a> Semantics...................................................<a href="#page-15">15</a> |
| 77 |
<a href="#section-4.3.1.1">4.3.1.1</a> Frequency.................................................<a href="#page-15">15</a> |
| 78 |
<a href="#section-4.3.1.2">4.3.1.2</a> Peak Rate.................................................<a href="#page-16">16</a> |
| 79 |
<a href="#section-4.3.1.3">4.3.1.3</a> Committed Rate............................................<a href="#page-16">16</a> |
| 80 |
<a href="#section-4.3.1.4">4.3.1.4</a> Excess Burst Size.........................................<a href="#page-16">16</a> |
| 81 |
<a href="#section-4.3.1.5">4.3.1.5</a> Peak Rate Token Bucket....................................<a href="#page-16">16</a> |
| 82 |
<a href="#section-4.3.1.6">4.3.1.6</a> Committed Data Rate Token Bucket..........................<a href="#page-17">17</a> |
| 83 |
<a href="#section-4.3.1.7">4.3.1.7</a> Weight....................................................<a href="#page-18">18</a> |
| 84 |
<a href="#section-4.3.2">4.3.2</a> Procedures..................................................<a href="#page-18">18</a> |
| 85 |
<a href="#section-4.3.2.1">4.3.2.1</a> Label Request Message.....................................<a href="#page-18">18</a> |
| 86 |
<a href="#section-4.3.2.2">4.3.2.2</a> Label Mapping Message.....................................<a href="#page-18">18</a> |
| 87 |
<a href="#section-4.3.2.3">4.3.2.3</a> Notification Message......................................<a href="#page-19">19</a> |
| 88 |
<a href="#section-4.4">4.4</a> Preemption TLV................................................<a href="#page-19">19</a> |
| 89 |
<a href="#section-4.5">4.5</a> LSPID TLV.....................................................<a href="#page-20">20</a> |
| 90 |
<a href="#section-4.6">4.6</a> Resource Class (Color) TLV....................................<a href="#page-21">21</a> |
| 91 |
<a href="#section-4.7">4.7</a> ER-Hop semantics..............................................<a href="#page-22">22</a> |
| 92 |
<a href="#section-4.7.1">4.7.1</a>. ER-Hop 1: The IPv4 prefix..................................<a href="#page-22">22</a> |
| 93 |
<a href="#section-4.7.2">4.7.2</a>. ER-Hop 2: The IPv6 address.................................<a href="#page-23">23</a> |
| 94 |
<a href="#section-4.7.3">4.7.3</a>. ER-Hop 3: The autonomous system number....................<a href="#page-24">24</a> |
| 95 |
<a href="#section-4.7.4">4.7.4</a>. ER-Hop 4: LSPID............................................<a href="#page-24">24</a> |
| 96 |
<a href="#section-4.8">4.8</a>. Processing of the Explicit Route TLV.........................<a href="#page-26">26</a> |
| 97 |
<a href="#section-4.8.1">4.8.1</a>. Selection of the next hop..................................<a href="#page-26">26</a> |
| 98 |
<a href="#section-4.8.2">4.8.2</a>. Adding ER-Hops to the explicit route TLV...................<a href="#page-27">27</a> |
| 99 |
<a href="#section-4.9">4.9</a> Route Pinning TLV.............................................<a href="#page-28">28</a> |
| 100 |
<a href="#section-4.10">4.10</a> CR-LSP FEC Element...........................................<a href="#page-28">28</a> |
| 101 |
<a href="#section-5">5</a>. IANA Considerations............................................<a href="#page-29">29</a> |
| 102 |
<a href="#section-5.1">5.1</a> TLV Type Name Space...........................................<a href="#page-29">29</a> |
| 103 |
<a href="#section-5.2">5.2</a> FEC Type Name Space...........................................<a href="#page-30">30</a> |
| 104 |
<a href="#section-5.3">5.3</a> Status Code Space.............................................<a href="#page-30">30</a> |
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Jamoussi, et al. Standards Track [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 111 |
|
| 112 |
|
| 113 |
<a href="#section-6">6</a>. Security Considerations........................................<a href="#page-31">31</a> |
| 114 |
<a href="#section-7">7</a>. Acknowledgments................................................<a href="#page-31">31</a> |
| 115 |
<a href="#section-8">8</a>. Intellectual Property Consideration............................<a href="#page-31">31</a> |
| 116 |
<a href="#section-9">9</a>. References.....................................................<a href="#page-32">32</a> |
| 117 |
<a href="#appendix-A">Appendix A</a>: CR-LSP Establishment Examples.........................<a href="#page-33">33</a> |
| 118 |
<a href="#appendix-A.1">A.1</a> Strict Explicit Route Example.................................<a href="#page-33">33</a> |
| 119 |
<a href="#appendix-A.2">A.2</a> Node Groups and Specific Nodes Example........................<a href="#page-34">34</a> |
| 120 |
<a href="#appendix-B">Appendix B</a>. QoS Service Examples..................................<a href="#page-36">36</a> |
| 121 |
<a href="#appendix-B.1">B.1</a> Service Examples..............................................<a href="#page-36">36</a> |
| 122 |
<a href="#appendix-B.2">B.2</a> Establishing CR-LSP Supporting Real-Time Applications.........<a href="#page-38">38</a> |
| 123 |
B.3 Establishing CR-LSP Supporting Delay Insensitive Applications.38 |
| 124 |
Author's Addresses................................................<a href="#page-39">39</a> |
| 125 |
Full Copyright Statement..........................................<a href="#page-42">42</a> |
| 126 |
|
| 127 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 128 |
|
| 129 |
Label Distribution Protocol (LDP) is defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] for distribution |
| 130 |
of labels inside one MPLS domain. One of the most important services |
| 131 |
that may be offered using MPLS in general and LDP in particular is |
| 132 |
support for constraint-based routing of traffic across the routed |
| 133 |
network. Constraint-based routing offers the opportunity to extend |
| 134 |
the information used to setup paths beyond what is available for the |
| 135 |
routing protocol. For instance, an LSP can be setup based on |
| 136 |
explicit route constraints, QoS constraints, and other constraints. |
| 137 |
Constraint-based routing (CR) is a mechanism used to meet Traffic |
| 138 |
Engineering requirements that have been proposed by, [<a href="#ref-2" title=""Multiprotocol Label Switching Architecture"">2</a>] and [<a href="#ref-3" title=""Requirements for Traffic Engineering Over MPLS"">3</a>]. |
| 139 |
These requirements may be met by extending LDP for support of |
| 140 |
constraint-based routed label switched paths (CR-LSPs). Other uses |
| 141 |
for CR-LSPs include MPLS-based VPNs [<a href="#ref-4" title=""A Framework for IP Based Virtual Private Networks"">4</a>]. More information about the |
| 142 |
applicability of CR-LDP can be found in [<a href="#ref-5" title=""Applicability Statement for CR-LDP"">5</a>]. |
| 143 |
|
| 144 |
The need for constraint-based routing (CR) in MPLS has been explored |
| 145 |
elsewhere [<a href="#ref-2" title=""Multiprotocol Label Switching Architecture"">2</a>], and [<a href="#ref-3" title=""Requirements for Traffic Engineering Over MPLS"">3</a>]. Explicit routing is a subset of the more |
| 146 |
general constraint-based routing function. At the MPLS WG meeting |
| 147 |
held during the Washington IETF (December 1997) there was consensus |
| 148 |
that LDP should support explicit routing of LSPs with provision for |
| 149 |
indication of associated (forwarding) priority. In the Chicago |
| 150 |
meeting (August 1998), a decision was made that support for explicit |
| 151 |
path setup in LDP will be moved to a separate document. This |
| 152 |
document provides that support and it has been accepted as a working |
| 153 |
document in the Orlando meeting (December 1998). |
| 154 |
|
| 155 |
|
| 156 |
|
| 157 |
|
| 158 |
|
| 159 |
|
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Jamoussi, et al. Standards Track [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 167 |
|
| 168 |
|
| 169 |
This specification proposes an end-to-end setup mechanism of a |
| 170 |
constraint-based routed LSP (CR-LSP) initiated by the ingress LSR. We |
| 171 |
also specify mechanisms to provide means for reservation of resources |
| 172 |
using LDP. |
| 173 |
|
| 174 |
This document introduce TLVs and procedures that provide support for: |
| 175 |
|
| 176 |
- Strict and Loose Explicit Routing |
| 177 |
- Specification of Traffic Parameters |
| 178 |
- Route Pinning |
| 179 |
- CR-LSP Preemption though setup/holding priorities |
| 180 |
- Handling Failures |
| 181 |
- LSPID |
| 182 |
- Resource Class |
| 183 |
|
| 184 |
<a href="#section-2">Section 2</a> introduces the various constraints defined in this |
| 185 |
specification. <a href="#section-3">Section 3</a> outlines the CR-LDP solution. <a href="#section-4">Section 4</a> |
| 186 |
defines the TLVs and procedures used to setup constraint-based routed |
| 187 |
label switched paths. <a href="#appendix-A">Appendix A</a> provides several examples of CR-LSP |
| 188 |
path setup. <a href="#appendix-B">Appendix B</a> provides Service Definition Examples. |
| 189 |
|
| 190 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Constraint-based Routing Overview</span> |
| 191 |
|
| 192 |
Constraint-based routing is a mechanism that supports the Traffic |
| 193 |
Engineering requirements defined in [<a href="#ref-3" title=""Requirements for Traffic Engineering Over MPLS"">3</a>]. Explicit Routing is a |
| 194 |
subset of the more general constraint-based routing where the |
| 195 |
constraint is the explicit route (ER). Other constraints are defined |
| 196 |
to provide a network operator with control over the path taken by an |
| 197 |
LSP. This section is an overview of the various constraints |
| 198 |
supported by this specification. |
| 199 |
|
| 200 |
Like any other LSP a CR-LSP is a path through an MPLS network. The |
| 201 |
difference is that while other paths are setup solely based on |
| 202 |
information in routing tables or from a management system, the |
| 203 |
constraint-based route is calculated at one point at the edge of |
| 204 |
network based on criteria, including but not limited to routing |
| 205 |
information. The intention is that this functionality shall give |
| 206 |
desired special characteristics to the LSP in order to better support |
| 207 |
the traffic sent over the LSP. The reason for setting up CR-LSPs |
| 208 |
might be that one wants to assign certain bandwidth or other Service |
| 209 |
Class characteristics to the LSP, or that one wants to make sure that |
| 210 |
alternative routes use physically separate paths through the network. |
| 211 |
|
| 212 |
|
| 213 |
|
| 214 |
|
| 215 |
|
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Jamoussi, et al. Standards Track [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 223 |
|
| 224 |
|
| 225 |
<span class="h3"><a class="selflink" id="section-2.1" href="#section-2.1">2.1</a> Strict and Loose Explicit Routes</span> |
| 226 |
|
| 227 |
An explicit route is represented in a Label Request Message as a list |
| 228 |
of nodes or groups of nodes along the constraint-based route. When |
| 229 |
the CR-LSP is established, all or a subset of the nodes in a group |
| 230 |
may be traversed by the LSP. Certain operations to be performed |
| 231 |
along the path can also be encoded in the constraint-based route. |
| 232 |
|
| 233 |
The capability to specify, in addition to specified nodes, groups of |
| 234 |
nodes, of which a subset will be traversed by the CR-LSP, allows the |
| 235 |
system a significant amount of local flexibility in fulfilling a |
| 236 |
request for a constraint-based route. This allows the generator of |
| 237 |
the constraint-based route to have some degree of imperfect |
| 238 |
information about the details of the path. |
| 239 |
|
| 240 |
The constraint-based route is encoded as a series of ER-Hops |
| 241 |
contained in a constraint-based route TLV. Each ER-Hop may identify |
| 242 |
a group of nodes in the constraint-based route. A constraint-based |
| 243 |
route is then a path including all of the identified groups of nodes |
| 244 |
in the order in which they appear in the TLV. |
| 245 |
|
| 246 |
To simplify the discussion, we call each group of nodes an "abstract |
| 247 |
node". Thus, we can also say that a constraint-based route is a path |
| 248 |
including all of the abstract nodes, with the specified operations |
| 249 |
occurring along that path. |
| 250 |
|
| 251 |
<span class="h3"><a class="selflink" id="section-2.2" href="#section-2.2">2.2</a> Traffic Characteristics</span> |
| 252 |
|
| 253 |
The traffic characteristics of a path are described in the Traffic |
| 254 |
Parameters TLV in terms of a peak rate, committed rate, and service |
| 255 |
granularity. The peak and committed rates describe the bandwidth |
| 256 |
constraints of a path while the service granularity can be used to |
| 257 |
specify a constraint on the delay variation that the CR-LDP MPLS |
| 258 |
domain may introduce to a path's traffic. |
| 259 |
|
| 260 |
<span class="h3"><a class="selflink" id="section-2.3" href="#section-2.3">2.3</a> Preemption</span> |
| 261 |
|
| 262 |
CR-LDP signals the resources required by a path on each hop of the |
| 263 |
route. If a route with sufficient resources can not be found, |
| 264 |
existing paths may be rerouted to reallocate resources to the new |
| 265 |
path. This is the process of path preemption. Setup and holding |
| 266 |
priorities are used to rank existing paths (holding priority) and the |
| 267 |
new path (setup priority) to determine if the new path can preempt an |
| 268 |
existing path. |
| 269 |
|
| 270 |
The setupPriority of a new CR-LSP and the holdingPriority attributes |
| 271 |
of the existing CR-LSP are used to specify priorities. Signaling a |
| 272 |
higher holding priority express that the path, once it has been |
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Jamoussi, et al. Standards Track [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 279 |
|
| 280 |
|
| 281 |
established, should have a lower chance of being preempted. Signaling |
| 282 |
a higher setup priority expresses the expectation that, in the case |
| 283 |
that resource are unavailable, the path is more likely to preempt |
| 284 |
other paths. The exact rules determining bumping are an aspect of |
| 285 |
network policy. |
| 286 |
|
| 287 |
The allocation of setup and holding priority values to paths is an |
| 288 |
aspect of network policy. |
| 289 |
|
| 290 |
The setup and holding priority values range from zero (0) to seven |
| 291 |
(7). The value zero (0) is the priority assigned to the most |
| 292 |
important path. It is referred to as the highest priority. Seven |
| 293 |
(7) is the priority for the least important path. The use of default |
| 294 |
priority values is an aspect of network policy. The recommended |
| 295 |
default value is (4). |
| 296 |
|
| 297 |
The setupPriority of a CR-LSP should not be higher (numerically less) |
| 298 |
than its holdingPriority since it might bump an LSP and be bumped by |
| 299 |
the next "equivalent" request. |
| 300 |
|
| 301 |
<span class="h3"><a class="selflink" id="section-2.4" href="#section-2.4">2.4</a> Route Pinning</span> |
| 302 |
|
| 303 |
Route pinning is applicable to segments of an LSP that are loosely |
| 304 |
routed - i.e. those segments which are specified with a next hop with |
| 305 |
the "L" bit set or where the next hop is an abstract node. A CR-LSP |
| 306 |
may be setup using route pinning if it is undesirable to change the |
| 307 |
path used by an LSP even when a better next hop becomes available at |
| 308 |
some LSR along the loosely routed portion of the LSP. |
| 309 |
|
| 310 |
<span class="h3"><a class="selflink" id="section-2.5" href="#section-2.5">2.5</a> Resource Class</span> |
| 311 |
|
| 312 |
The network operator may classify network resources in various ways. |
| 313 |
These classes are also known as "colors" or "administrative groups". |
| 314 |
When a CR-LSP is being established, it's necessary to indicate which |
| 315 |
resource classes the CR-LSP can draw from. |
| 316 |
|
| 317 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Solution Overview</span> |
| 318 |
|
| 319 |
CR-LSP over LDP Specification is designed with the following goals: |
| 320 |
|
| 321 |
1. Meet the requirements outlined in [<a href="#ref-3" title=""Requirements for Traffic Engineering Over MPLS"">3</a>] for performing traffic |
| 322 |
engineering and provide a solid foundation for performing more |
| 323 |
general constraint-based routing. |
| 324 |
|
| 325 |
2. Build on already specified functionality that meets the |
| 326 |
requirements whenever possible. Hence, this specification is |
| 327 |
based on [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. |
| 328 |
|
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Jamoussi, et al. Standards Track [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 335 |
|
| 336 |
|
| 337 |
3. Keep the solution simple. |
| 338 |
|
| 339 |
In this document, support for unidirectional point-to-point CR-LSPs |
| 340 |
is specified. Support for point-to-multipoint, multipoint-to-point, |
| 341 |
is for further study (FFS). |
| 342 |
|
| 343 |
Support for constraint-based routed LSPs in this specification |
| 344 |
depends on the following minimal LDP behaviors as specified in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]: |
| 345 |
|
| 346 |
- Use of Basic and/or Extended Discovery Mechanisms. |
| 347 |
- Use of the Label Request Message defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] in downstream |
| 348 |
on demand label advertisement mode with ordered control. |
| 349 |
- Use of the Label Mapping Message defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] in downstream |
| 350 |
on demand mode with ordered control. |
| 351 |
- Use of the Notification Message defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. |
| 352 |
- Use of the Withdraw and Release Messages defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. |
| 353 |
- Use of the Loop Detection (in the case of loosely routed |
| 354 |
segments of a CR-LSP) mechanisms defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. |
| 355 |
|
| 356 |
In addition, the following functionality is added to what's defined |
| 357 |
in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]: |
| 358 |
|
| 359 |
- The Label Request Message used to setup a CR-LSP includes one |
| 360 |
or more CR-TLVs defined in <a href="#section-4">Section 4</a>. For instance, the Label |
| 361 |
Request Message may include the ER-TLV. |
| 362 |
|
| 363 |
- An LSR implicitly infers ordered control from the existence of |
| 364 |
one or more CR-TLVs in the Label Request Message. This means |
| 365 |
that the LSR can still be configured for independent control |
| 366 |
for LSPs established as a result of dynamic routing. However, |
| 367 |
when a Label Request Message includes one or more of the CR- |
| 368 |
TLVs, then ordered control is used to setup the CR-LSP. Note |
| 369 |
that this is also true for the loosely routed parts of a CR- |
| 370 |
LSP. |
| 371 |
|
| 372 |
- New status codes are defined to handle error notification for |
| 373 |
failure of established paths specified in the CR-TLVs. All of |
| 374 |
the new status codes require that the F bit be set. |
| 375 |
|
| 376 |
Optional TLVs MUST be implemented to be compliant with the protocol. |
| 377 |
However, they are optionally carried in the CR-LDP messages to signal |
| 378 |
certain characteristics of the CR-LSP being established or modified. |
| 379 |
|
| 380 |
Examples of CR-LSP establishment are given in <a href="#appendix-A">Appendix A</a> to |
| 381 |
illustrate how the mechanisms described in this document work. |
| 382 |
|
| 383 |
|
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Jamoussi, et al. Standards Track [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 391 |
|
| 392 |
|
| 393 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a> Required Messages and TLVs</span> |
| 394 |
|
| 395 |
Any Messages, TLVs, and procedures not defined explicitly in this |
| 396 |
document are defined in the LDP Specification [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. The reader can |
| 397 |
use [<a href="#ref-7" title=""LDP State Machine"">7</a>] as an informational document about the state transitions, |
| 398 |
which relate to CR-LDP messages. |
| 399 |
|
| 400 |
The following subsections are meant as a cross-reference to the [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] |
| 401 |
document and indication of additional functionality beyond what's |
| 402 |
defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] where necessary. |
| 403 |
|
| 404 |
Note that use of the Status TLV is not limited to Notification |
| 405 |
messages as specified in Section 3.4.6 of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. A message other than |
| 406 |
a Notification message may carry a Status TLV as an Optional |
| 407 |
Parameter. When a message other than a Notification carries a Status |
| 408 |
TLV the U-bit of the Status TLV should be set to 1 to indicate that |
| 409 |
the receiver should silently discard the TLV if unprepared to handle |
| 410 |
it. |
| 411 |
|
| 412 |
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a> Label Request Message</span> |
| 413 |
|
| 414 |
The Label Request Message is as defined in 3.5.8 of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] with the |
| 415 |
following modifications (required only if any of the CR-TLVs is |
| 416 |
included in the Label Request Message): |
| 417 |
|
| 418 |
- The Label Request Message MUST include a single FEC-TLV |
| 419 |
element. The CR-LSP FEC TLV element SHOULD be used. However, |
| 420 |
the other FEC- TLVs defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] MAY be used instead for |
| 421 |
certain applications. |
| 422 |
|
| 423 |
- The Optional Parameters TLV includes the definition of any of |
| 424 |
the Constraint-based TLVs specified in <a href="#section-4">Section 4</a>. |
| 425 |
|
| 426 |
- The Procedures to handle the Label Request Message are |
| 427 |
augmented by the procedures for processing of the CR-TLVs as |
| 428 |
defined in <a href="#section-4">Section 4</a>. |
| 429 |
|
| 430 |
|
| 431 |
|
| 432 |
|
| 433 |
|
| 434 |
|
| 435 |
|
| 436 |
|
| 437 |
|
| 438 |
|
| 439 |
|
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Jamoussi, et al. Standards Track [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 447 |
|
| 448 |
|
| 449 |
The encoding for the CR-LDP Label Request Message is as follows: |
| 450 |
|
| 451 |
0 1 2 3 |
| 452 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 453 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 454 |
|0| Label Request (0x0401) | Message Length | |
| 455 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 456 |
| Message ID | |
| 457 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 458 |
| FEC TLV | |
| 459 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 460 |
| LSPID TLV (CR-LDP, mandatory) | |
| 461 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 462 |
| ER-TLV (CR-LDP, optional) | |
| 463 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 464 |
| Traffic TLV (CR-LDP, optional) | |
| 465 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 466 |
| Pinning TLV (CR-LDP, optional) | |
| 467 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 468 |
| Resource Class TLV (CR-LDP, optional) | |
| 469 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 470 |
| Preemption TLV (CR-LDP, optional) | |
| 471 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 472 |
|
| 473 |
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a> Label Mapping Message</span> |
| 474 |
|
| 475 |
The Label Mapping Message is as defined in 3.5.7 of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] with the |
| 476 |
following modifications: |
| 477 |
|
| 478 |
- The Label Mapping Message MUST include a single Label-TLV. |
| 479 |
|
| 480 |
- The Label Mapping Message Procedures are limited to downstream |
| 481 |
on demand ordered control mode. |
| 482 |
|
| 483 |
A Mapping message is transmitted by a downstream LSR to an upstream |
| 484 |
LSR under one of the following conditions: |
| 485 |
|
| 486 |
1. The LSR is the egress end of the CR-LSP and an upstream mapping |
| 487 |
has been requested. |
| 488 |
|
| 489 |
2. The LSR received a mapping from its downstream next hop LSR for |
| 490 |
an CR-LSP for which an upstream request is still pending. |
| 491 |
|
| 492 |
|
| 493 |
|
| 494 |
|
| 495 |
|
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Jamoussi, et al. Standards Track [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 503 |
|
| 504 |
|
| 505 |
The encoding for the CR-LDP Label Mapping Message is as follows: |
| 506 |
|
| 507 |
0 1 2 3 |
| 508 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 509 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 510 |
|0| Label Mapping (0x0400) | Message Length | |
| 511 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 512 |
| Message ID | |
| 513 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 514 |
| FEC TLV | |
| 515 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 516 |
| Label TLV | |
| 517 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 518 |
| Label Request Message ID TLV | |
| 519 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 520 |
| LSPID TLV (CR-LDP, optional) | |
| 521 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 522 |
| Traffic TLV (CR-LDP, optional) | |
| 523 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 524 |
|
| 525 |
<span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a> Notification Message</span> |
| 526 |
|
| 527 |
The Notification Message is as defined in Section 3.5.1 of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] and |
| 528 |
the Status TLV encoding is as defined in Section 3.4.6 of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. |
| 529 |
Establishment of an CR-LSP may fail for a variety of reasons. All |
| 530 |
such failures are considered advisory conditions and they are |
| 531 |
signaled by the Notification Message. |
| 532 |
|
| 533 |
Notification Messages carry Status TLVs to specify events being |
| 534 |
signaled. New status codes are defined in <a href="#section-4.11">Section 4.11</a> to signal |
| 535 |
error notifications associated with the establishment of a CR-LSP and |
| 536 |
the processing of the CR-TLV. All of the new status codes require |
| 537 |
that the F bit be set. |
| 538 |
|
| 539 |
The Notification Message MAY carry the LSPID TLV of the corresponding |
| 540 |
CR-LSP. |
| 541 |
|
| 542 |
Notification Messages MUST be forwarded toward the LSR originating |
| 543 |
the Label Request at each hop and at any time that procedures in this |
| 544 |
specification - or in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] - specify sending of a Notification Message |
| 545 |
in response to a Label Request Message. |
| 546 |
|
| 547 |
|
| 548 |
|
| 549 |
|
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
<span class="grey">Jamoussi, et al. Standards Track [Page 10]</span></pre> |
| 557 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 558 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 559 |
|
| 560 |
|
| 561 |
The encoding of the notification message is as follows: |
| 562 |
|
| 563 |
0 1 2 3 |
| 564 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 565 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 566 |
|0| Notification (0x0001) | Message Length | |
| 567 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 568 |
| Message ID | |
| 569 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 570 |
| Status (TLV) | |
| 571 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 572 |
| Optional Parameters | |
| 573 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 574 |
|
| 575 |
<span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a> Release , Withdraw, and Abort Messages</span> |
| 576 |
|
| 577 |
The Label Release , Label Withdraw, and Label Abort Request Messages |
| 578 |
are used as specified in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. These messages MAY also carry the |
| 579 |
LSPID TLV. |
| 580 |
|
| 581 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Protocol Specification</span> |
| 582 |
|
| 583 |
The Label Request Message defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] MUST carry the LSPID TLV and |
| 584 |
MAY carry one or more of the optional Constraint-based Routing TLVs |
| 585 |
(CR-TLVs) defined in this section. If needed, other constraints can |
| 586 |
be supported later through the definition of new TLVs. In this |
| 587 |
specification, the following TLVs are defined: |
| 588 |
|
| 589 |
- Explicit Route TLV |
| 590 |
- Explicit Route Hop TLV |
| 591 |
- Traffic Parameters TLV |
| 592 |
- Preemption TLV |
| 593 |
- LSPID TLV |
| 594 |
- Route Pinning TLV |
| 595 |
- Resource Class TLV |
| 596 |
- CR-LSP FEC TLV |
| 597 |
|
| 598 |
<span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a> Explicit Route TLV (ER-TLV)</span> |
| 599 |
|
| 600 |
The ER-TLV is an object that specifies the path to be taken by the |
| 601 |
LSP being established. It is composed of one or more Explicit Route |
| 602 |
Hop TLVs (ER-Hop TLVs) defined in <a href="#section-4.2">Section 4.2</a>. |
| 603 |
|
| 604 |
|
| 605 |
|
| 606 |
|
| 607 |
|
| 608 |
|
| 609 |
|
| 610 |
|
| 611 |
|
| 612 |
<span class="grey">Jamoussi, et al. Standards Track [Page 11]</span></pre> |
| 613 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 614 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 615 |
|
| 616 |
|
| 617 |
0 1 2 3 |
| 618 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 619 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 620 |
|0|0| Type = 0x0800 | Length | |
| 621 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 622 |
| ER-Hop TLV 1 | |
| 623 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 624 |
| ER-Hop TLV 2 | |
| 625 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 626 |
~ ............ ~ |
| 627 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 628 |
| ER-Hop TLV n | |
| 629 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 630 |
|
| 631 |
Type |
| 632 |
A fourteen-bit field carrying the value of the ER-TLV |
| 633 |
Type = 0x0800. |
| 634 |
|
| 635 |
Length |
| 636 |
Specifies the length of the value field in bytes. |
| 637 |
|
| 638 |
ER-Hop TLVs |
| 639 |
One or more ER-Hop TLVs defined in <a href="#section-4.2">Section 4.2</a>. |
| 640 |
|
| 641 |
<span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a> Explicit Route Hop TLV (ER-Hop TLV)</span> |
| 642 |
|
| 643 |
The contents of an ER-TLV are a series of variable length ER-Hop |
| 644 |
TLVs. |
| 645 |
|
| 646 |
A node receiving a label request message including an ER-Hop type |
| 647 |
that is not supported MUST not progress the label request message to |
| 648 |
the downstream LSR and MUST send back a "No Route" Notification |
| 649 |
Message. |
| 650 |
|
| 651 |
Each ER-Hop TLV has the form: |
| 652 |
|
| 653 |
0 1 2 3 |
| 654 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 655 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 656 |
|0|0| Type | Length | |
| 657 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 658 |
|L| Content // | |
| 659 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 660 |
|
| 661 |
|
| 662 |
|
| 663 |
|
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
<span class="grey">Jamoussi, et al. Standards Track [Page 12]</span></pre> |
| 669 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span> |
| 670 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 671 |
|
| 672 |
|
| 673 |
ER-Hop Type |
| 674 |
A fourteen-bit field carrying the type of the ER-Hop contents. |
| 675 |
Currently defined values are: |
| 676 |
|
| 677 |
Value Type |
| 678 |
------ ------------------------ |
| 679 |
0x0801 IPv4 prefix |
| 680 |
0x0802 IPv6 prefix |
| 681 |
0x0803 Autonomous system number |
| 682 |
0x0804 LSPID |
| 683 |
|
| 684 |
Length |
| 685 |
Specifies the length of the value field in bytes. |
| 686 |
|
| 687 |
L bit |
| 688 |
The L bit in the ER-Hop is a one-bit attribute. If the L bit |
| 689 |
is set, then the value of the attribute is "loose." Otherwise, |
| 690 |
the value of the attribute is "strict." For brevity, we say |
| 691 |
that if the value of the ER-Hop attribute is loose then it is a |
| 692 |
"loose ER-Hop." Otherwise, it's a "strict ER-Hop." Further, |
| 693 |
we say that the abstract node of a strict or loose ER-Hop is a |
| 694 |
strict or a loose node, respectively. Loose and strict nodes |
| 695 |
are always interpreted relative to their prior abstract nodes. |
| 696 |
The path between a strict node and its prior node MUST include |
| 697 |
only network nodes from the strict node and its prior abstract |
| 698 |
node. |
| 699 |
|
| 700 |
The path between a loose node and its prior node MAY include |
| 701 |
other network nodes, which are not part of the strict node or |
| 702 |
its prior abstract node. |
| 703 |
|
| 704 |
Contents |
| 705 |
A variable length field containing a node or abstract node |
| 706 |
which is one of the consecutive nodes that make up the |
| 707 |
explicitly routed LSP. |
| 708 |
|
| 709 |
<span class="h3"><a class="selflink" id="section-4.3" href="#section-4.3">4.3</a> Traffic Parameters TLV</span> |
| 710 |
|
| 711 |
The following sections describe the CR-LSP Traffic Parameters. The |
| 712 |
required characteristics of a CR-LSP are expressed by the Traffic |
| 713 |
Parameter values. |
| 714 |
|
| 715 |
A Traffic Parameters TLV, is used to signal the Traffic Parameter |
| 716 |
values. The Traffic Parameters are defined in the subsequent |
| 717 |
sections. |
| 718 |
|
| 719 |
|
| 720 |
|
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
<span class="grey">Jamoussi, et al. Standards Track [Page 13]</span></pre> |
| 725 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span> |
| 726 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 727 |
|
| 728 |
|
| 729 |
The Traffic Parameters TLV contains a Flags field, a Frequency, a |
| 730 |
Weight, and the five Traffic Parameters PDR, PBS, CDR, CBS, EBS. |
| 731 |
|
| 732 |
0 1 2 3 |
| 733 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 734 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 735 |
|0|0| Type = 0x0810 | Length = 24 | |
| 736 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 737 |
| Flags | Frequency | Reserved | Weight | |
| 738 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 739 |
| Peak Data Rate (PDR) | |
| 740 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 741 |
| Peak Burst Size (PBS) | |
| 742 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 743 |
| Committed Data Rate (CDR) | |
| 744 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 745 |
| Committed Burst Size (CBS) | |
| 746 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 747 |
| Excess Burst Size (EBS) | |
| 748 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 749 |
|
| 750 |
Type |
| 751 |
A fourteen-bit field carrying the value of the Traffic |
| 752 |
Parameters TLV Type = 0x0810. |
| 753 |
|
| 754 |
Length |
| 755 |
Specifies the length of the value field in bytes = 24. |
| 756 |
|
| 757 |
Flags |
| 758 |
The Flags field is shown below: |
| 759 |
|
| 760 |
+--+--+--+--+--+--+--+--+ |
| 761 |
| Res |F6|F5|F4|F3|F2|F1| |
| 762 |
+--+--+--+--+--+--+--+--+ |
| 763 |
|
| 764 |
Res - These bits are reserved. |
| 765 |
Zero on transmission. |
| 766 |
Ignored on receipt. |
| 767 |
F1 - Corresponds to the PDR. |
| 768 |
F2 - Corresponds to the PBS. |
| 769 |
F3 - Corresponds to the CDR. |
| 770 |
F4 - Corresponds to the CBS. |
| 771 |
F5 - Corresponds to the EBS. |
| 772 |
F6 - Corresponds to the Weight. |
| 773 |
|
| 774 |
|
| 775 |
|
| 776 |
|
| 777 |
|
| 778 |
|
| 779 |
|
| 780 |
<span class="grey">Jamoussi, et al. Standards Track [Page 14]</span></pre> |
| 781 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span> |
| 782 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 783 |
|
| 784 |
|
| 785 |
Each flag Fi is a Negotiable Flag corresponding to a Traffic |
| 786 |
Parameter. The Negotiable Flag value zero denotes |
| 787 |
NotNegotiable and value one denotes Negotiable. |
| 788 |
|
| 789 |
Frequency |
| 790 |
The Frequency field is coded as an 8 bit unsigned integer with |
| 791 |
the following code points defined: |
| 792 |
|
| 793 |
0- Unspecified |
| 794 |
1- Frequent |
| 795 |
2- VeryFrequent |
| 796 |
3-255 - Reserved |
| 797 |
Reserved - Zero on transmission. Ignored on receipt. |
| 798 |
|
| 799 |
Weight |
| 800 |
An 8 bit unsigned integer indicating the weight of the CR-LSP. |
| 801 |
Valid weight values are from 1 to 255. The value 0 means that |
| 802 |
weight is not applicable for the CR-LSP. |
| 803 |
|
| 804 |
Traffic Parameters |
| 805 |
Each Traffic Parameter is encoded as a 32-bit IEEE single- |
| 806 |
precision floating-point number. A value of positive infinity |
| 807 |
is represented as an IEEE single-precision floating-point |
| 808 |
number with an exponent of all ones (255) and a sign and |
| 809 |
mantissa of all zeros. The values PDR and CDR are in units of |
| 810 |
bytes per second. The values PBS, CBS and EBS are in units of |
| 811 |
bytes. |
| 812 |
|
| 813 |
The value of PDR MUST be greater than or equal to the value of |
| 814 |
CDR in a correctly encoded Traffic Parameters TLV. |
| 815 |
|
| 816 |
<span class="h4"><a class="selflink" id="section-4.3.1" href="#section-4.3.1">4.3.1</a> Semantics</span> |
| 817 |
|
| 818 |
<span class="h5"><a class="selflink" id="section-4.3.1.1" href="#section-4.3.1.1">4.3.1.1</a> Frequency</span> |
| 819 |
|
| 820 |
The Frequency specifies at what granularity the CDR allocated to the |
| 821 |
CR-LSP is made available. The value VeryFrequent means that the |
| 822 |
available rate should average at least the CDR when measured over any |
| 823 |
time interval equal to or longer than the shortest packet time at the |
| 824 |
CDR. The value Frequent means that the available rate should average |
| 825 |
at least the CDR when measured over any time interval equal to or |
| 826 |
longer than a small number of shortest packet times at the CDR. |
| 827 |
|
| 828 |
The value Unspecified means that the CDR MAY be provided at any |
| 829 |
granularity. |
| 830 |
|
| 831 |
|
| 832 |
|
| 833 |
|
| 834 |
|
| 835 |
|
| 836 |
<span class="grey">Jamoussi, et al. Standards Track [Page 15]</span></pre> |
| 837 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span> |
| 838 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 839 |
|
| 840 |
|
| 841 |
<span class="h5"><a class="selflink" id="section-4.3.1.2" href="#section-4.3.1.2">4.3.1.2</a> Peak Rate</span> |
| 842 |
|
| 843 |
The Peak Rate defines the maximum rate at which traffic SHOULD be |
| 844 |
sent to the CR-LSP. The Peak Rate is useful for the purpose of |
| 845 |
resource allocation. If resource allocation within the MPLS domain |
| 846 |
depends on the Peak Rate value then it should be enforced at the |
| 847 |
ingress to the MPLS domain. |
| 848 |
|
| 849 |
The Peak Rate is defined in terms of the two Traffic Parameters PDR |
| 850 |
and PBS, see <a href="#section-4.3.1.5">section 4.3.1.5</a> below. |
| 851 |
|
| 852 |
<span class="h5"><a class="selflink" id="section-4.3.1.3" href="#section-4.3.1.3">4.3.1.3</a> Committed Rate</span> |
| 853 |
|
| 854 |
The Committed Rate defines the rate that the MPLS domain commits to |
| 855 |
be available to the CR-LSP. |
| 856 |
|
| 857 |
The Committed Rate is defined in terms of the two Traffic Parameters |
| 858 |
CDR and CBS, see <a href="#section-4.3.1.6">section 4.3.1.6</a> below. |
| 859 |
|
| 860 |
<span class="h5"><a class="selflink" id="section-4.3.1.4" href="#section-4.3.1.4">4.3.1.4</a> Excess Burst Size</span> |
| 861 |
|
| 862 |
The Excess Burst Size may be used at the edge of an MPLS domain for |
| 863 |
the purpose of traffic conditioning. The EBS MAY be used to measure |
| 864 |
the extent by which the traffic sent on a CR-LSP exceeds the |
| 865 |
committed rate. |
| 866 |
|
| 867 |
The possible traffic conditioning actions, such as passing, marking |
| 868 |
or dropping, are specific to the MPLS domain. |
| 869 |
|
| 870 |
The Excess Burst Size is defined together with the Committed Rate, |
| 871 |
see <a href="#section-4.3.1.6">section 4.3.1.6</a> below. |
| 872 |
|
| 873 |
<span class="h5"><a class="selflink" id="section-4.3.1.5" href="#section-4.3.1.5">4.3.1.5</a> Peak Rate Token Bucket</span> |
| 874 |
|
| 875 |
The Peak Rate of a CR-LSP is specified in terms of a token bucket P |
| 876 |
with token rate PDR and maximum token bucket size PBS. |
| 877 |
|
| 878 |
The token bucket P is initially (at time 0) full, i.e., the token |
| 879 |
count Tp(0) = PBS. Thereafter, the token count Tp, if less than PBS, |
| 880 |
is incremented by one PDR times per second. When a packet of size B |
| 881 |
bytes arrives at time t, the following happens: |
| 882 |
|
| 883 |
- If Tp(t)-B >= 0, the packet is not in excess of the peak rate |
| 884 |
and Tp is decremented by B down to the minimum value of 0, else |
| 885 |
|
| 886 |
- the packet is in excess of the peak rate and Tp is not |
| 887 |
decremented. |
| 888 |
|
| 889 |
|
| 890 |
|
| 891 |
|
| 892 |
<span class="grey">Jamoussi, et al. Standards Track [Page 16]</span></pre> |
| 893 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span> |
| 894 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 895 |
|
| 896 |
|
| 897 |
Note that according to the above definition, a positive infinite |
| 898 |
value of either PDR or PBS implies that arriving packets are never in |
| 899 |
excess of the peak rate. |
| 900 |
|
| 901 |
The actual implementation of an LSR doesn't need to be modeled |
| 902 |
according to the above formal token bucket specification. |
| 903 |
|
| 904 |
<span class="h5"><a class="selflink" id="section-4.3.1.6" href="#section-4.3.1.6">4.3.1.6</a> Committed Data Rate Token Bucket</span> |
| 905 |
|
| 906 |
The committed rate of a CR-LSP is specified in terms of a token |
| 907 |
bucket C with rate CDR. The extent by which the offered rate exceeds |
| 908 |
the committed rate MAY be measured in terms of another token bucket |
| 909 |
E, which also operates at rate CDR. The maximum size of the token |
| 910 |
bucket C is CBS and the maximum size of the token bucket E is EBS. |
| 911 |
|
| 912 |
The token buckets C and E are initially (at time 0) full, i.e., the |
| 913 |
token count Tc(0) = CBS and the token count Te(0) = EBS. |
| 914 |
|
| 915 |
Thereafter, the token counts Tc and Te are updated CDR times per |
| 916 |
second as follows: |
| 917 |
|
| 918 |
- If Tc is less than CBS, Tc is incremented by one, else |
| 919 |
- if Te is less then EBS, Te is incremented by one, else neither |
| 920 |
Tc nor Te is incremented. |
| 921 |
|
| 922 |
When a packet of size B bytes arrives at time t, the following |
| 923 |
happens: |
| 924 |
|
| 925 |
- If Tc(t)-B >= 0, the packet is not in excess of the Committed |
| 926 |
Rate and Tc is decremented by B down to the minimum value of 0, |
| 927 |
else |
| 928 |
|
| 929 |
- if Te(t)-B >= 0, the packet is in excess of the Committed rate |
| 930 |
but is not in excess of the EBS and Te is decremented by B down |
| 931 |
to the minimum value of 0, else |
| 932 |
|
| 933 |
- the packet is in excess of both the Committed Rate and the EBS |
| 934 |
and neither Tc nor Te is decremented. |
| 935 |
|
| 936 |
Note that according to the above specification, a CDR value of |
| 937 |
positive infinity implies that arriving packets are never in excess |
| 938 |
of either the Committed Rate or EBS. A positive infinite value of |
| 939 |
either CBS or EBS implies that the respective limit cannot be |
| 940 |
exceeded. |
| 941 |
|
| 942 |
The actual implementation of an LSR doesn't need to be modeled |
| 943 |
according to the above formal specification. |
| 944 |
|
| 945 |
|
| 946 |
|
| 947 |
|
| 948 |
<span class="grey">Jamoussi, et al. Standards Track [Page 17]</span></pre> |
| 949 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span> |
| 950 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 951 |
|
| 952 |
|
| 953 |
<span class="h5"><a class="selflink" id="section-4.3.1.7" href="#section-4.3.1.7">4.3.1.7</a> Weight</span> |
| 954 |
|
| 955 |
The weight determines the CR-LSP's relative share of the possible |
| 956 |
excess bandwidth above its committed rate. The definition of |
| 957 |
"relative share" is MPLS domain specific. |
| 958 |
|
| 959 |
<span class="h4"><a class="selflink" id="section-4.3.2" href="#section-4.3.2">4.3.2</a> Procedures</span> |
| 960 |
|
| 961 |
<span class="h5"><a class="selflink" id="section-4.3.2.1" href="#section-4.3.2.1">4.3.2.1</a> Label Request Message</span> |
| 962 |
|
| 963 |
If an LSR receives an incorrectly encoded Traffic Parameters TLV in |
| 964 |
which the value of PDR is less than the value of CDR then it MUST |
| 965 |
send a Notification Message including the Status code "Traffic |
| 966 |
Parameters Unavailable" to the upstream LSR from which it received |
| 967 |
the erroneous message. |
| 968 |
|
| 969 |
If a Traffic Parameter is indicated as Negotiable in the Label |
| 970 |
Request Message by the corresponding Negotiable Flag then an LSR MAY |
| 971 |
replace the Traffic Parameter value with a smaller value. |
| 972 |
|
| 973 |
If the Weight is indicated as Negotiable in the Label Request Message |
| 974 |
by the corresponding Negotiable Flag then an LSR may replace the |
| 975 |
Weight value with a lower value (down to 0). |
| 976 |
|
| 977 |
If, after possible Traffic Parameter negotiation, an LSR can support |
| 978 |
the CR-LSP Traffic Parameters then the LSR MUST reserve the |
| 979 |
corresponding resources for the CR-LSP. |
| 980 |
|
| 981 |
If, after possible Traffic Parameter negotiation, an LSR cannot |
| 982 |
support the CR-LSP Traffic Parameters then the LSR MUST send a |
| 983 |
Notification Message that contains the "Resource Unavailable" status |
| 984 |
code. |
| 985 |
|
| 986 |
<span class="h5"><a class="selflink" id="section-4.3.2.2" href="#section-4.3.2.2">4.3.2.2</a> Label Mapping Message</span> |
| 987 |
|
| 988 |
If an LSR receives an incorrectly encoded Traffic Parameters TLV in |
| 989 |
which the value of PDR is less than the value of CDR then it MUST |
| 990 |
send a Label Release message containing the Status code "Traffic |
| 991 |
Parameters Unavailable" to the LSR from which it received the |
| 992 |
erroneous message. In addition, the LSP should send a Notification |
| 993 |
Message upstream with the status code 'Label Request Aborted'. |
| 994 |
|
| 995 |
If the negotiation flag was set in the label request message, the |
| 996 |
egress LSR MUST include the (possibly negotiated) Traffic Parameters |
| 997 |
and Weight in the Label Mapping message. |
| 998 |
|
| 999 |
The Traffic Parameters and the Weight in a Label Mapping message MUST |
| 1000 |
be forwarded unchanged. |
| 1001 |
|
| 1002 |
|
| 1003 |
|
| 1004 |
<span class="grey">Jamoussi, et al. Standards Track [Page 18]</span></pre> |
| 1005 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span> |
| 1006 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1007 |
|
| 1008 |
|
| 1009 |
An LSR SHOULD adjust the resources that it reserved for a CR-LSP when |
| 1010 |
it receives a Label Mapping Message if the Traffic Parameters differ |
| 1011 |
from those in the corresponding Label Request Message. |
| 1012 |
|
| 1013 |
<span class="h5"><a class="selflink" id="section-4.3.2.3" href="#section-4.3.2.3">4.3.2.3</a> Notification Message</span> |
| 1014 |
|
| 1015 |
If an LSR receives a Notification Message for a CR-LSP, it SHOULD |
| 1016 |
release any resources that it possibly had reserved for the CR-LSP. |
| 1017 |
In addition, on receiving a Notification Message from a Downstream |
| 1018 |
LSR that is associated with a Label Request from an upstream LSR, the |
| 1019 |
local LSR MUST propagate the Notification message using the |
| 1020 |
procedures in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>]. Further the F bit MUST be set. |
| 1021 |
|
| 1022 |
<span class="h3"><a class="selflink" id="section-4.4" href="#section-4.4">4.4</a> Preemption TLV</span> |
| 1023 |
|
| 1024 |
The default value of the setup and holding priorities should be in |
| 1025 |
the middle of the range (e.g., 4) so that this feature can be turned |
| 1026 |
on gradually in an operational network by increasing or decreasing |
| 1027 |
the priority starting at the middle of the range. |
| 1028 |
|
| 1029 |
Since the Preemption TLV is an optional TLV, LSPs that are setup |
| 1030 |
without an explicitly signaled preemption TLV SHOULD be treated as |
| 1031 |
LSPs with the default setup and holding priorities (e.g., 4). |
| 1032 |
|
| 1033 |
When an established LSP is preempted, the LSR that initiates the |
| 1034 |
preemption sends a Withdraw Message upstream and a Release Message |
| 1035 |
downstream. |
| 1036 |
|
| 1037 |
When an LSP in the process of being established (outstanding Label |
| 1038 |
Request without getting a Label Mapping back) is preempted, the LSR |
| 1039 |
that initiates the preemption, sends a Notification Message upstream |
| 1040 |
and an Abort Message downstream. |
| 1041 |
|
| 1042 |
0 1 2 3 |
| 1043 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1044 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1045 |
|0|0| Type = 0x0820 | Length = 4 | |
| 1046 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1047 |
| SetPrio | HoldPrio | Reserved | |
| 1048 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1049 |
|
| 1050 |
Type |
| 1051 |
A fourteen-bit field carrying the value of the Preemption-TLV |
| 1052 |
Type = 0x0820. |
| 1053 |
|
| 1054 |
Length |
| 1055 |
Specifies the length of the value field in bytes = 4. |
| 1056 |
|
| 1057 |
|
| 1058 |
|
| 1059 |
|
| 1060 |
<span class="grey">Jamoussi, et al. Standards Track [Page 19]</span></pre> |
| 1061 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span> |
| 1062 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1063 |
|
| 1064 |
|
| 1065 |
Reserved |
| 1066 |
Zero on transmission. Ignored on receipt. |
| 1067 |
|
| 1068 |
SetPrio |
| 1069 |
A SetupPriority of value zero (0) is the priority assigned to |
| 1070 |
the most important path. It is referred to as the highest |
| 1071 |
priority. Seven (7) is the priority for the least important |
| 1072 |
path. The higher the setup priority, the more paths CR-LDP can |
| 1073 |
bump to set up the path. The default value should be 4. |
| 1074 |
|
| 1075 |
HoldPrio |
| 1076 |
A HoldingPriority of value zero (0) is the priority assigned to |
| 1077 |
the most important path. It is referred to as the highest |
| 1078 |
priority. Seven (7) is the priority for the least important |
| 1079 |
path. The default value should be 4. |
| 1080 |
The higher the holding priority, the less likely it is for CR- |
| 1081 |
LDP to reallocate its bandwidth to a new path. |
| 1082 |
|
| 1083 |
<span class="h3"><a class="selflink" id="section-4.5" href="#section-4.5">4.5</a> LSPID TLV</span> |
| 1084 |
|
| 1085 |
LSPID is a unique identifier of a CR-LSP within an MPLS network. |
| 1086 |
|
| 1087 |
The LSPID is composed of the ingress LSR Router ID (or any of its |
| 1088 |
own Ipv4 addresses) and a Locally unique CR-LSP ID to that LSR. |
| 1089 |
|
| 1090 |
The LSPID is useful in network management, in CR-LSP repair, and in |
| 1091 |
using an already established CR-LSP as a hop in an ER-TLV. |
| 1092 |
|
| 1093 |
An "action indicator flag" is carried in the LSPID TLV. This "action |
| 1094 |
indicator flag" indicates explicitly the action that should be taken |
| 1095 |
if the LSP already exists on the LSR receiving the message. |
| 1096 |
|
| 1097 |
After a CR-LSP is set up, its bandwidth reservation may need to be |
| 1098 |
changed by the network operator, due to the new requirements for the |
| 1099 |
traffic carried on that CR-LSP. The "action indicator flag" is used |
| 1100 |
indicate the need to modify the bandwidth and possibly other |
| 1101 |
parameters of an established CR-LSP without service interruption. |
| 1102 |
This feature has application in dynamic network resources management |
| 1103 |
where traffic of different priorities and service classes is |
| 1104 |
involved. |
| 1105 |
|
| 1106 |
The procedure for the code point "modify" is defined in [<a href="#ref-8" title=""LSP Modification Using CR-LDP"">8</a>]. The |
| 1107 |
procedures for other flags are FFS. |
| 1108 |
|
| 1109 |
|
| 1110 |
|
| 1111 |
|
| 1112 |
|
| 1113 |
|
| 1114 |
|
| 1115 |
|
| 1116 |
<span class="grey">Jamoussi, et al. Standards Track [Page 20]</span></pre> |
| 1117 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span> |
| 1118 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1119 |
|
| 1120 |
|
| 1121 |
0 1 2 3 |
| 1122 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1123 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1124 |
|0|0| Type = 0x0821 | Length = 4 | |
| 1125 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1126 |
| Reserved |ActFlg | Local CR-LSP ID | |
| 1127 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1128 |
| Ingress LSR Router ID | |
| 1129 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1130 |
|
| 1131 |
Type |
| 1132 |
A fourteen-bit field carrying the value of the LSPID-TLV |
| 1133 |
Type = 0x0821. |
| 1134 |
|
| 1135 |
Length |
| 1136 |
Specifies the length of the value field in bytes = 4. |
| 1137 |
|
| 1138 |
ActFlg |
| 1139 |
Action Indicator Flag: A 4-bit field that indicates explicitly |
| 1140 |
the action that should be taken if the LSP already exists on |
| 1141 |
the LSR receiving the message. A set of indicator code points |
| 1142 |
is proposed as follows: |
| 1143 |
|
| 1144 |
0000: indicates initial LSP setup |
| 1145 |
0001: indicates modify LSP |
| 1146 |
|
| 1147 |
Reserved |
| 1148 |
Zero on transmission. Ignored on receipt. |
| 1149 |
|
| 1150 |
Local CR-LSP ID |
| 1151 |
The Local LSP ID is an identifier of the CR-LSP locally unique |
| 1152 |
within the Ingress LSR originating the CR-LSP. |
| 1153 |
|
| 1154 |
Ingress LSR Router ID |
| 1155 |
An LSR may use any of its own IPv4 addresses in this field. |
| 1156 |
|
| 1157 |
<span class="h3"><a class="selflink" id="section-4.6" href="#section-4.6">4.6</a> Resource Class (Color) TLV</span> |
| 1158 |
|
| 1159 |
The Resource Class as defined in [<a href="#ref-3" title=""Requirements for Traffic Engineering Over MPLS"">3</a>] is used to specify which links |
| 1160 |
are acceptable by this CR-LSP. This information allows for the |
| 1161 |
network's topology to be pruned. |
| 1162 |
|
| 1163 |
|
| 1164 |
|
| 1165 |
|
| 1166 |
|
| 1167 |
|
| 1168 |
|
| 1169 |
|
| 1170 |
|
| 1171 |
|
| 1172 |
<span class="grey">Jamoussi, et al. Standards Track [Page 21]</span></pre> |
| 1173 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span> |
| 1174 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1175 |
|
| 1176 |
|
| 1177 |
0 1 2 3 |
| 1178 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1179 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1180 |
|0|0| Type = 0x0822 | Length = 4 | |
| 1181 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1182 |
| RsCls | |
| 1183 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1184 |
|
| 1185 |
Type |
| 1186 |
A fourteen-bit field carrying the value of the ResCls-TLV |
| 1187 |
Type = 0x0822. |
| 1188 |
|
| 1189 |
Length |
| 1190 |
Specifies the length of the value field in bytes = 4. |
| 1191 |
|
| 1192 |
RsCls |
| 1193 |
The Resource Class bit mask indicating which of the 32 |
| 1194 |
"administrative groups" or "colors" of links the CR-LSP can |
| 1195 |
traverse. |
| 1196 |
|
| 1197 |
<span class="h3"><a class="selflink" id="section-4.7" href="#section-4.7">4.7</a> ER-Hop semantics</span> |
| 1198 |
|
| 1199 |
<span class="h4"><a class="selflink" id="section-4.7.1" href="#section-4.7.1">4.7.1</a>. ER-Hop 1: The IPv4 prefix</span> |
| 1200 |
|
| 1201 |
The abstract node represented by this ER-Hop is the set of nodes, |
| 1202 |
which have an IP address, which lies within this prefix. Note that a |
| 1203 |
prefix length of 32 indicates a single IPv4 node. |
| 1204 |
|
| 1205 |
0 1 2 3 |
| 1206 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1207 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1208 |
|0|0| Type = 0x0801 | Length = 8 | |
| 1209 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1210 |
|L| Reserved | PreLen | |
| 1211 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1212 |
| IPv4 Address (4 bytes) | |
| 1213 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1214 |
|
| 1215 |
Type |
| 1216 |
A fourteen-bit field carrying the value of the ER-Hop 1, IPv4 |
| 1217 |
Address, Type = 0x0801 |
| 1218 |
|
| 1219 |
Length |
| 1220 |
Specifies the length of the value field in bytes = 8. |
| 1221 |
|
| 1222 |
L Bit |
| 1223 |
Set to indicate Loose hop. |
| 1224 |
Cleared to indicate a strict hop. |
| 1225 |
|
| 1226 |
|
| 1227 |
|
| 1228 |
<span class="grey">Jamoussi, et al. Standards Track [Page 22]</span></pre> |
| 1229 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span> |
| 1230 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1231 |
|
| 1232 |
|
| 1233 |
Reserved |
| 1234 |
Zero on transmission. Ignored on receipt. |
| 1235 |
|
| 1236 |
PreLen |
| 1237 |
Prefix Length 1-32 |
| 1238 |
|
| 1239 |
IP Address |
| 1240 |
A four-byte field indicating the IP Address. |
| 1241 |
|
| 1242 |
<span class="h4"><a class="selflink" id="section-4.7.2" href="#section-4.7.2">4.7.2</a>. ER-Hop 2: The IPv6 address</span> |
| 1243 |
|
| 1244 |
0 1 2 3 |
| 1245 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1246 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1247 |
|0|0| 0x0802 | Length = 20 | |
| 1248 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1249 |
|L| Reserved | PreLen | |
| 1250 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1251 |
| IPV6 address | |
| 1252 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1253 |
| IPV6 address (continued) | |
| 1254 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1255 |
| IPV6 address (continued) | |
| 1256 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1257 |
| IPV6 address (continued) | |
| 1258 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1259 |
|
| 1260 |
Type |
| 1261 |
A fourteen-bit field carrying the value of the ER-Hop 2, IPv6 |
| 1262 |
Address, Type = 0x0802 |
| 1263 |
|
| 1264 |
Length |
| 1265 |
Specifies the length of the value field in bytes = 20. |
| 1266 |
|
| 1267 |
L Bit |
| 1268 |
Set to indicate Loose hop. |
| 1269 |
Cleared to indicate a strict hop. |
| 1270 |
|
| 1271 |
Reserved |
| 1272 |
Zero on transmission. Ignored on receipt. |
| 1273 |
|
| 1274 |
PreLen |
| 1275 |
Prefix Length 1-128 |
| 1276 |
|
| 1277 |
IPv6 address |
| 1278 |
A 128-bit unicast host address. |
| 1279 |
|
| 1280 |
|
| 1281 |
|
| 1282 |
|
| 1283 |
|
| 1284 |
<span class="grey">Jamoussi, et al. Standards Track [Page 23]</span></pre> |
| 1285 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span> |
| 1286 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1287 |
|
| 1288 |
|
| 1289 |
<span class="h4"><a class="selflink" id="section-4.7.3" href="#section-4.7.3">4.7.3</a>. ER-Hop 3: </span>The autonomous system number |
| 1290 |
|
| 1291 |
The abstract node represented by this ER-Hop is the set of nodes |
| 1292 |
belonging to the autonomous system. |
| 1293 |
|
| 1294 |
0 1 2 3 |
| 1295 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1296 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1297 |
|0|0| 0x0803 | Length = 4 | |
| 1298 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1299 |
|L| Reserved | AS Number | |
| 1300 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1301 |
|
| 1302 |
Type |
| 1303 |
A fourteen-bit field carrying the value of the ER-Hop 3, AS |
| 1304 |
Number, Type = 0x0803 |
| 1305 |
|
| 1306 |
Length |
| 1307 |
Specifies the length of the value field in bytes = 4. |
| 1308 |
|
| 1309 |
L Bit |
| 1310 |
Set to indicate Loose hop. |
| 1311 |
Cleared to indicate a strict hop. |
| 1312 |
|
| 1313 |
Reserved |
| 1314 |
Zero on transmission. Ignored on receipt. |
| 1315 |
|
| 1316 |
AS Number |
| 1317 |
Autonomous System number |
| 1318 |
|
| 1319 |
<span class="h4"><a class="selflink" id="section-4.7.4" href="#section-4.7.4">4.7.4</a>. ER-Hop 4: LSPID</span> |
| 1320 |
|
| 1321 |
The LSPID is used to identify the tunnel ingress point as the next |
| 1322 |
hop in the ER. This ER-Hop allows for stacking new CR-LSPs within an |
| 1323 |
already established CR-LSP. It also allows for splicing the CR-LSP |
| 1324 |
being established with an existing CR-LSP. |
| 1325 |
|
| 1326 |
If an LSPID Hop is the last ER-Hop in an ER-TLV, than the LSR may |
| 1327 |
splice the CR-LSP of the incoming Label Request to the CR-LSP that |
| 1328 |
currently exists with this LSPID. This is useful, for example, at |
| 1329 |
the point at which a Label Request used for local repair arrives at |
| 1330 |
the next ER-Hop after the loosely specified CR-LSP segment. Use of |
| 1331 |
the LSPID Hop in this scenario eliminates the need for ER-Hops to |
| 1332 |
keep the entire remaining ER-TLV at each LSR that is at either |
| 1333 |
(upstream or downstream) end of a loosely specified CR-LSP segment as |
| 1334 |
part of its state information. This is due to the fact that the |
| 1335 |
|
| 1336 |
|
| 1337 |
|
| 1338 |
|
| 1339 |
|
| 1340 |
<span class="grey">Jamoussi, et al. Standards Track [Page 24]</span></pre> |
| 1341 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span> |
| 1342 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1343 |
|
| 1344 |
|
| 1345 |
upstream LSR needs only to keep the next ER-Hop and the LSPID and the |
| 1346 |
downstream LSR needs only to keep the LSPID in order for each end to |
| 1347 |
be able to recognize that the same LSP is being identified. |
| 1348 |
|
| 1349 |
If the LSPID Hop is not the last hop in an ER-TLV, the LSR must |
| 1350 |
remove the LSP-ID Hop and forward the remaining ER-TLV in a Label |
| 1351 |
Request message using an LDP session established with the LSR that is |
| 1352 |
the specified CR-LSP's egress. That LSR will continue processing of |
| 1353 |
the CR-LSP Label Request Message. The result is a tunneled, or |
| 1354 |
stacked, CR-LSP. |
| 1355 |
|
| 1356 |
To support labels negotiated for tunneled CR-LSP segments, an LDP |
| 1357 |
session is required [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] between tunnel end points - possibly using |
| 1358 |
the existing CR-LSP. Use of the existence of the CR-LSP in lieu of a |
| 1359 |
session, or other possible session-less approaches, is FFS. |
| 1360 |
|
| 1361 |
0 1 2 3 |
| 1362 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1363 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1364 |
|0|0| 0x0804 | Length = 8 | |
| 1365 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1366 |
|L| Reserved | Local LSPID | |
| 1367 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1368 |
| Ingress LSR Router ID | |
| 1369 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1370 |
|
| 1371 |
Type |
| 1372 |
A fourteen-bit field carrying the value of the ER-Hop 4, LSPID, |
| 1373 |
Type = 0x0804 |
| 1374 |
|
| 1375 |
Length |
| 1376 |
Specifies the length of the value field in bytes = 8. |
| 1377 |
|
| 1378 |
L Bit |
| 1379 |
Set to indicate Loose hop. |
| 1380 |
Cleared to indicate a strict hop. |
| 1381 |
|
| 1382 |
Reserved |
| 1383 |
Zero on transmission. Ignored on receipt. |
| 1384 |
|
| 1385 |
Local LSPID |
| 1386 |
A 2 byte field indicating the LSPID which is unique with |
| 1387 |
reference to its Ingress LSR. |
| 1388 |
|
| 1389 |
Ingress LSR Router ID |
| 1390 |
An LSR may use any of its own IPv4 addresses in this field. |
| 1391 |
|
| 1392 |
|
| 1393 |
|
| 1394 |
|
| 1395 |
|
| 1396 |
<span class="grey">Jamoussi, et al. Standards Track [Page 25]</span></pre> |
| 1397 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-26" ></span> |
| 1398 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1399 |
|
| 1400 |
|
| 1401 |
<span class="h3"><a class="selflink" id="section-4.8" href="#section-4.8">4.8</a>. Processing of the Explicit Route TLV</span> |
| 1402 |
|
| 1403 |
<span class="h4"><a class="selflink" id="section-4.8.1" href="#section-4.8.1">4.8.1</a>. Selection of the next hop</span> |
| 1404 |
|
| 1405 |
A Label Request Message containing an explicit route TLV must |
| 1406 |
determine the next hop for this path. Selection of this next hop may |
| 1407 |
involve a selection from a set of possible alternatives. The |
| 1408 |
mechanism for making a selection from this set is implementation |
| 1409 |
dependent and is outside of the scope of this specification. |
| 1410 |
Selection of particular paths is also outside of the scope of this |
| 1411 |
specification, but it is assumed that each node will make a best |
| 1412 |
effort attempt to determine a loop-free path. Note that such best |
| 1413 |
efforts may be overridden by local policy. |
| 1414 |
|
| 1415 |
To determine the next hop for the path, a node performs the following |
| 1416 |
steps: |
| 1417 |
|
| 1418 |
1. The node receiving the Label Request Message must first |
| 1419 |
evaluate the first ER-Hop. If the L bit is not set in the |
| 1420 |
first ER-Hop and if the node is not part of the abstract node |
| 1421 |
described by the first ER-Hop, it has received the message in |
| 1422 |
error, and should return a "Bad Initial ER-Hop Error" status. |
| 1423 |
If the L bit is set and the local node is not part of the |
| 1424 |
abstract node described by the first ER-Hop, the node selects a |
| 1425 |
next hop that is along the path to the abstract node described |
| 1426 |
by the first ER-Hop. If there is no first ER-Hop, the message |
| 1427 |
is also in error and the system should return a "Bad Explicit |
| 1428 |
Routing TLV Error" status using a Notification Message sent |
| 1429 |
upstream. |
| 1430 |
|
| 1431 |
2. If there is no second ER-Hop, this indicates the end of the |
| 1432 |
explicit route. The explicit route TLV should be removed from |
| 1433 |
the Label Request Message. This node may or may not be the end |
| 1434 |
of the LSP. Processing continues with <a href="#section-4.8.2">section 4.8.2</a>, where a |
| 1435 |
new explicit route TLV may be added to the Label Request |
| 1436 |
Message. |
| 1437 |
|
| 1438 |
3. If the node is also a part of the abstract node described by |
| 1439 |
the second ER-Hop, then the node deletes the first ER-Hop and |
| 1440 |
continues processing with step 2, above. Note that this makes |
| 1441 |
the second ER-Hop into the first ER-Hop of the next iteration. |
| 1442 |
|
| 1443 |
4. The node determines if it is topologically adjacent to the |
| 1444 |
abstract node described by the second ER-Hop. If so, the node |
| 1445 |
selects a particular next hop which is a member of the abstract |
| 1446 |
node. The node then deletes the first ER-Hop and continues |
| 1447 |
processing with <a href="#section-4.8.2">section 4.8.2</a>. |
| 1448 |
|
| 1449 |
|
| 1450 |
|
| 1451 |
|
| 1452 |
<span class="grey">Jamoussi, et al. Standards Track [Page 26]</span></pre> |
| 1453 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-27" ></span> |
| 1454 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1455 |
|
| 1456 |
|
| 1457 |
5. Next, the node selects a next hop within the abstract node of |
| 1458 |
the first ER-Hop that is along the path to the abstract node of |
| 1459 |
the second ER-Hop. If no such path exists then there are two |
| 1460 |
cases: |
| 1461 |
|
| 1462 |
5.a If the second ER-Hop is a strict ER-Hop, then there is an |
| 1463 |
error and the node should return a "Bad Strict Node Error" |
| 1464 |
status. |
| 1465 |
|
| 1466 |
5.b Otherwise, if the second ER-Hop is a loose ER-Hop, then the |
| 1467 |
node selects any next hop that is along the path to the |
| 1468 |
next abstract node. If no path exists within the MPLS |
| 1469 |
domain, then there is an error, and the node should return |
| 1470 |
a "Bad Loose Node Error" status. |
| 1471 |
|
| 1472 |
6. Finally, the node replaces the first ER-Hop with any ER-Hop |
| 1473 |
that denotes an abstract node containing the next hop. This is |
| 1474 |
necessary so that when the explicit route is received by the |
| 1475 |
next hop, it will be accepted. |
| 1476 |
|
| 1477 |
7. Progress the Label Request Message to the next hop. |
| 1478 |
|
| 1479 |
<span class="h4"><a class="selflink" id="section-4.8.2" href="#section-4.8.2">4.8.2</a>. Adding ER-Hops to the explicit route TLV</span> |
| 1480 |
|
| 1481 |
After selecting a next hop, the node may alter the explicit route in |
| 1482 |
the following ways. |
| 1483 |
|
| 1484 |
If, as part of executing the algorithm in <a href="#section-4.8.1">section 4.8.1</a>, the explicit |
| 1485 |
route TLV is removed, the node may add a new explicit route TLV. |
| 1486 |
|
| 1487 |
Otherwise, if the node is a member of the abstract node for the first |
| 1488 |
ER-Hop, then a series of ER-Hops may be inserted before the first |
| 1489 |
ER-Hop or may replace the first ER-Hop. Each ER-Hop in this series |
| 1490 |
must denote an abstract node that is a subset of the current abstract |
| 1491 |
node. |
| 1492 |
|
| 1493 |
Alternately, if the first ER-Hop is a loose ER-Hop, an arbitrary |
| 1494 |
series of ER-Hops may be inserted prior to the first ER-Hop. |
| 1495 |
|
| 1496 |
|
| 1497 |
|
| 1498 |
|
| 1499 |
|
| 1500 |
|
| 1501 |
|
| 1502 |
|
| 1503 |
|
| 1504 |
|
| 1505 |
|
| 1506 |
|
| 1507 |
|
| 1508 |
<span class="grey">Jamoussi, et al. Standards Track [Page 27]</span></pre> |
| 1509 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-28" ></span> |
| 1510 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1511 |
|
| 1512 |
|
| 1513 |
<span class="h3"><a class="selflink" id="section-4.9" href="#section-4.9">4.9</a> Route Pinning TLV</span> |
| 1514 |
|
| 1515 |
<a href="#section-2.4">Section 2.4</a> describes the use of route pinning. The encoding of the |
| 1516 |
Route Pinning TLV is as follows: |
| 1517 |
|
| 1518 |
0 1 2 3 |
| 1519 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1520 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1521 |
|0|0| Type = 0x0823 | Length = 4 | |
| 1522 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1523 |
|P| Reserved | |
| 1524 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1525 |
|
| 1526 |
Type |
| 1527 |
A fourteen-bit field carrying the value of the Pinning-TLV |
| 1528 |
Type = 0x0823 |
| 1529 |
|
| 1530 |
Length |
| 1531 |
Specifies the length of the value field in bytes = 4. |
| 1532 |
|
| 1533 |
P Bit |
| 1534 |
The P bit is set to 1 to indicate that route pinning is |
| 1535 |
requested. |
| 1536 |
The P bit is set to 0 to indicate that route pinning is not |
| 1537 |
requested |
| 1538 |
|
| 1539 |
Reserved |
| 1540 |
Zero on transmission. Ignored on receipt. |
| 1541 |
|
| 1542 |
<span class="h3"><a class="selflink" id="section-4.10" href="#section-4.10">4.10</a> CR-LSP FEC Element</span> |
| 1543 |
|
| 1544 |
A new FEC element is introduced in this specification to support CR- |
| 1545 |
LSPs. A FEC TLV containing a FEC of Element type CR-LSP (0x04) is a |
| 1546 |
CR-LSP FEC TLV. The CR-LSP FEC Element is an opaque FEC to be used |
| 1547 |
only in Messages of CR-LSPs. |
| 1548 |
|
| 1549 |
A single FEC element MUST be included in the Label Request Message. |
| 1550 |
The FEC Element SHOULD be the CR-LSP FEC Element. However, one of |
| 1551 |
the other FEC elements (Type=0x01, 0x02, 0x03) defined in [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] MAY be |
| 1552 |
in CR-LDP messages instead of the CR-LSP FEC Element for certain |
| 1553 |
applications. A FEC TLV containing a FEC of Element type CR-LSP |
| 1554 |
(0x04) is a CR-LSP FEC TLV. |
| 1555 |
|
| 1556 |
FEC Element Type Value |
| 1557 |
Type name |
| 1558 |
|
| 1559 |
CR-LSP 0x04 No value; i.e., 0 value octets; |
| 1560 |
|
| 1561 |
|
| 1562 |
|
| 1563 |
|
| 1564 |
<span class="grey">Jamoussi, et al. Standards Track [Page 28]</span></pre> |
| 1565 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-29" ></span> |
| 1566 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1567 |
|
| 1568 |
|
| 1569 |
The CR-LSP FEC TLV encoding is as follows: |
| 1570 |
|
| 1571 |
0 1 2 3 |
| 1572 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 1573 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1574 |
|0|0| Type = 0x0100 | Length = 1 | |
| 1575 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 1576 |
| CR-LSP (4) | |
| 1577 |
+-+-+-+-+-+-+-+-+ |
| 1578 |
|
| 1579 |
Type |
| 1580 |
A fourteen-bit field carrying the value of the FEC TLV |
| 1581 |
Type = 0x0100 |
| 1582 |
|
| 1583 |
Length |
| 1584 |
Specifies the length of the value field in bytes = 1. |
| 1585 |
|
| 1586 |
CR-LSP FEC Element Type |
| 1587 |
|
| 1588 |
0x04 |
| 1589 |
|
| 1590 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. IANA Considerations</span> |
| 1591 |
|
| 1592 |
CR-LDP defines the following name spaces, which require management: |
| 1593 |
|
| 1594 |
- TLV types. |
| 1595 |
- FEC types. |
| 1596 |
- Status codes. |
| 1597 |
|
| 1598 |
The following sections provide guidelines for managing these name |
| 1599 |
spaces. |
| 1600 |
|
| 1601 |
<span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a> TLV Type Name Space</span> |
| 1602 |
|
| 1603 |
<a href="./rfc3036">RFC 3036</a> [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] defines the LDP TLV name space. This document further |
| 1604 |
subdivides the range of <a href="./rfc3036">RFC 3036</a> from that TLV space for TLVs |
| 1605 |
associated with the CR-LDP in the range 0x0800 - 0x08FF. |
| 1606 |
|
| 1607 |
Following the policies outlined in [IANA], TLV types in this range |
| 1608 |
are allocated through an IETF Consensus action. |
| 1609 |
|
| 1610 |
|
| 1611 |
|
| 1612 |
|
| 1613 |
|
| 1614 |
|
| 1615 |
|
| 1616 |
|
| 1617 |
|
| 1618 |
|
| 1619 |
|
| 1620 |
<span class="grey">Jamoussi, et al. Standards Track [Page 29]</span></pre> |
| 1621 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-30" ></span> |
| 1622 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1623 |
|
| 1624 |
|
| 1625 |
Initial values for this range are specified in the following table: |
| 1626 |
|
| 1627 |
TLV Type |
| 1628 |
-------------------------------------- ---------- |
| 1629 |
Explicit Route TLV 0x0800 |
| 1630 |
Ipv4 Prefix ER-Hop TLV 0x0801 |
| 1631 |
Ipv6 Prefix ER-Hop TLV 0x0802 |
| 1632 |
Autonomous System Number ER-Hop TLV 0x0803 |
| 1633 |
LSP-ID ER-Hop TLV 0x0804 |
| 1634 |
Traffic Parameters TLV 0x0810 |
| 1635 |
Preemption TLV 0x0820 |
| 1636 |
LSPID TLV 0x0821 |
| 1637 |
Resource Class TLV 0x0822 |
| 1638 |
Route Pinning TLV 0x0823 |
| 1639 |
|
| 1640 |
<span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a> FEC Type Name Space</span> |
| 1641 |
|
| 1642 |
<a href="./rfc3036">RFC 3036</a> defines the FEC Type name space. Further, <a href="./rfc3036">RFC 3036</a> has |
| 1643 |
assigned values 0x00 through 0x03. FEC types 0 through 127 are |
| 1644 |
available for assignment through IETF consensus action. This |
| 1645 |
specification makes the following additional assignment, using the |
| 1646 |
policies outlined in [IANA]: |
| 1647 |
|
| 1648 |
FEC Element Type |
| 1649 |
-------------------------------------- ---------- |
| 1650 |
CR-LSP FEC Element 0x04 |
| 1651 |
|
| 1652 |
<span class="h3"><a class="selflink" id="section-5.3" href="#section-5.3">5.3</a> Status Code Space</span> |
| 1653 |
|
| 1654 |
<a href="./rfc3036">RFC 3036</a> defines the Status Code name space. This document further |
| 1655 |
subdivides the range of <a href="./rfc3036">RFC 3036</a> from that TLV space for TLVs |
| 1656 |
associated with the CR-LDP in the range 0x04000000 - 0x040000FF. |
| 1657 |
|
| 1658 |
Following the policies outlined in [IANA], TLV types in this range |
| 1659 |
are allocated through an IETF Consensus action. |
| 1660 |
|
| 1661 |
|
| 1662 |
|
| 1663 |
|
| 1664 |
|
| 1665 |
|
| 1666 |
|
| 1667 |
|
| 1668 |
|
| 1669 |
|
| 1670 |
|
| 1671 |
|
| 1672 |
|
| 1673 |
|
| 1674 |
|
| 1675 |
|
| 1676 |
<span class="grey">Jamoussi, et al. Standards Track [Page 30]</span></pre> |
| 1677 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-31" ></span> |
| 1678 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1679 |
|
| 1680 |
|
| 1681 |
Initial values for this range are specified in the following table: |
| 1682 |
|
| 1683 |
Status Code Type |
| 1684 |
-------------------------------------- ---------- |
| 1685 |
|
| 1686 |
Bad Explicit Routing TLV Error 0x04000001 |
| 1687 |
Bad Strict Node Error 0x04000002 |
| 1688 |
Bad Loose Node Error 0x04000003 |
| 1689 |
Bad Initial ER-Hop Error 0x04000004 |
| 1690 |
Resource Unavailable 0x04000005 |
| 1691 |
Traffic Parameters Unavailable 0x04000006 |
| 1692 |
LSP Preempted 0x04000007 |
| 1693 |
Modify Request Not Supported 0x04000008 |
| 1694 |
|
| 1695 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Security Considerations</span> |
| 1696 |
|
| 1697 |
CR-LDP inherits the same security mechanism described in Section 4.0 |
| 1698 |
of [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] to protect against the introduction of spoofed TCP segments |
| 1699 |
into LDP session connection streams. |
| 1700 |
|
| 1701 |
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Acknowledgments</span> |
| 1702 |
|
| 1703 |
The messages used to signal the CR-LSP setup are based on the work |
| 1704 |
done by the LDP [<a href="#ref-1" title=""Label Distribution Protocol Specification"">1</a>] design team. |
| 1705 |
|
| 1706 |
The list of authors provided with this document is a reduction of the |
| 1707 |
original list. Currently listed authors wish to acknowledge that a |
| 1708 |
substantial amount was also contributed to this work by: |
| 1709 |
|
| 1710 |
Osama Aboul-Magd, Peter Ashwood-Smith, Joel Halpern, |
| 1711 |
Fiffi Hellstrand, Kenneth Sundell and Pasi Vaananen. |
| 1712 |
|
| 1713 |
The authors would also like to acknowledge the careful review and |
| 1714 |
comments of Ken Hayward, Greg Wright, Geetha Brown, Brian Williams, |
| 1715 |
Paul Beaubien, Matthew Yuen, Liam Casey, Ankur Anand and Adrian |
| 1716 |
Farrel. |
| 1717 |
|
| 1718 |
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Intellectual Property Consideration</span> |
| 1719 |
|
| 1720 |
The IETF has been notified of intellectual property rights claimed in |
| 1721 |
regard to some or all of the specification contained in this |
| 1722 |
document. For more information consult the online list of claimed |
| 1723 |
rights. |
| 1724 |
|
| 1725 |
|
| 1726 |
|
| 1727 |
|
| 1728 |
|
| 1729 |
|
| 1730 |
|
| 1731 |
|
| 1732 |
<span class="grey">Jamoussi, et al. Standards Track [Page 31]</span></pre> |
| 1733 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-32" ></span> |
| 1734 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1735 |
|
| 1736 |
|
| 1737 |
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. References</span> |
| 1738 |
|
| 1739 |
[<a id="ref-1">1</a>] Andersson, L., Doolan, P., Feldman, N., Fredette, A. and B. |
| 1740 |
Thomas, "Label Distribution Protocol Specification", <a href="./rfc3036">RFC 3036</a>, |
| 1741 |
January 2001. |
| 1742 |
|
| 1743 |
[<a id="ref-2">2</a>] Rosen, E., Viswanathan, A. and R. Callon, "Multiprotocol Label |
| 1744 |
Switching Architecture", <a href="./rfc3031">RFC 3031</a>, January 2001. |
| 1745 |
|
| 1746 |
[<a id="ref-3">3</a>] Awduche, D., Malcolm, J., Agogbua, J., O'Dell, M. and J. McManus, |
| 1747 |
"Requirements for Traffic Engineering Over MPLS", <a href="./rfc2702">RFC 2702</a>, |
| 1748 |
September 1999. |
| 1749 |
|
| 1750 |
[<a id="ref-4">4</a>] Gleeson, B., Lin, A., Heinanen, Armitage, G. and A. Malis, "A |
| 1751 |
Framework for IP Based Virtual Private Networks", <a href="./rfc2764">RFC 2764</a>, |
| 1752 |
February 2000. |
| 1753 |
|
| 1754 |
[<a id="ref-5">5</a>] Ash, J., Girish, M., Gray, E., Jamoussi, B. and G. Wright, |
| 1755 |
"Applicability Statement for CR-LDP", <a href="./rfc3213">RFC 3213</a>, January 2002. |
| 1756 |
|
| 1757 |
[<a id="ref-6">6</a>] Bradner, S., "Key words for use in RFCs to Indicate Requirement |
| 1758 |
Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>, March 1997. |
| 1759 |
|
| 1760 |
[<a id="ref-7">7</a>] Boscher, C., Cheval, P., Wu, L. and E. Gray, "LDP State Machine", |
| 1761 |
<a href="./rfc3215">RFC 3215</a>, January 2002. |
| 1762 |
|
| 1763 |
[<a id="ref-8">8</a>] Ash, J., Lee, Y., Ashwood-Smith, P., Jamoussi, B., Fedyk, D., |
| 1764 |
Skalecki, D. and L. Li, "LSP Modification Using CR-LDP", <a href="./rfc3214">RFC</a> |
| 1765 |
<a href="./rfc3214">3214</a>, January 2002. |
| 1766 |
|
| 1767 |
|
| 1768 |
|
| 1769 |
|
| 1770 |
|
| 1771 |
|
| 1772 |
|
| 1773 |
|
| 1774 |
|
| 1775 |
|
| 1776 |
|
| 1777 |
|
| 1778 |
|
| 1779 |
|
| 1780 |
|
| 1781 |
|
| 1782 |
|
| 1783 |
|
| 1784 |
|
| 1785 |
|
| 1786 |
|
| 1787 |
|
| 1788 |
<span class="grey">Jamoussi, et al. Standards Track [Page 32]</span></pre> |
| 1789 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-33" ></span> |
| 1790 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1791 |
|
| 1792 |
|
| 1793 |
Appendix A: CR-LSP Establishment Examples |
| 1794 |
|
| 1795 |
<span class="h3"><a class="selflink" id="appendix-A.1" href="#appendix-A.1">A.1</a> Strict Explicit Route Example</span> |
| 1796 |
|
| 1797 |
This appendix provides an example for the setup of a strictly routed |
| 1798 |
CR-LSP. In this example, a specific node represents each abstract |
| 1799 |
node. |
| 1800 |
|
| 1801 |
The sample network used here is a four node network with two edge |
| 1802 |
LSRs and two core LSRs as follows: |
| 1803 |
|
| 1804 |
abc |
| 1805 |
LSR1------LSR2------LSR3------LSR4 |
| 1806 |
|
| 1807 |
LSR1 generates a Label Request Message as described in <a href="#section-3.1">Section 3.1</a> of |
| 1808 |
this document and sends it to LSR2. This message includes the CR- |
| 1809 |
TLV. |
| 1810 |
|
| 1811 |
A vector of three ER-Hop TLVs <a, b, c> composes the ER-TLV. The ER- |
| 1812 |
Hop TLVs used in this example are of type 0x0801 (IPv4 prefix) with a |
| 1813 |
prefix length of 32. Hence, each ER-Hop TLV identifies a specific |
| 1814 |
node as opposed to a group of nodes. At LSR2, the following |
| 1815 |
processing of the ER-TLV per <a href="#section-4.8.1">Section 4.8.1</a> of this document takes |
| 1816 |
place: |
| 1817 |
|
| 1818 |
1. The node LSR2 is part of the abstract node described by the |
| 1819 |
first hop <a>. Therefore, the first step passes the test. Go |
| 1820 |
to step 2. |
| 1821 |
|
| 1822 |
2. There is a second ER-Hop, <b>. Go to step 3. |
| 1823 |
|
| 1824 |
3. LSR2 is not part of the abstract node described by the second |
| 1825 |
ER-Hop <b>. Go to Step 4. |
| 1826 |
|
| 1827 |
4. LSR2 determines that it is topologically adjacent to the |
| 1828 |
abstract node described by the second ER-Hop <b>. LSR2 selects |
| 1829 |
a next hop (LSR3) which is the abstract node. LSR2 deletes the |
| 1830 |
first ER-Hop <a> from the ER-TLV, which now becomes <b, c>. |
| 1831 |
Processing continues with <a href="#section-4.8.2">Section 4.8.2</a>. |
| 1832 |
|
| 1833 |
At LSR2, the following processing of <a href="#section-4.8.2">Section 4.8.2</a> takes place: |
| 1834 |
Executing algorithm 4.8.1 did not result in the removal of the ER- |
| 1835 |
TLV. |
| 1836 |
|
| 1837 |
Also, LSR2 is not a member of the abstract node described by the |
| 1838 |
first ER-Hop <b>. |
| 1839 |
|
| 1840 |
Finally, the first ER-Hop <b> is a strict hop. |
| 1841 |
|
| 1842 |
|
| 1843 |
|
| 1844 |
<span class="grey">Jamoussi, et al. Standards Track [Page 33]</span></pre> |
| 1845 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-34" ></span> |
| 1846 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1847 |
|
| 1848 |
|
| 1849 |
Therefore, processing <a href="#section-4.8.2">section 4.8.2</a> does not result in the insertion |
| 1850 |
of new ER-Hops. The selection of the next hop has been already done |
| 1851 |
is step 4 of <a href="#section-4.8.1">Section 4.8.1</a> and the processing of the ER-TLV is |
| 1852 |
completed at LSR2. In this case, the Label Request Message including |
| 1853 |
the ER-TLV <b, c> is progressed by LSR2 to LSR3. |
| 1854 |
|
| 1855 |
At LSR3, a similar processing to the ER-TLV takes place except that |
| 1856 |
the incoming ER-TLV = <b, c> and the outgoing ER-TLV is <c>. |
| 1857 |
|
| 1858 |
At LSR4, the following processing of <a href="#section-4.8.1">section 4.8.1</a> takes place: |
| 1859 |
|
| 1860 |
1. The node LSR4 is part of the abstract node described by the |
| 1861 |
first hop <c>. Therefore, the first step passes the test. Go |
| 1862 |
to step 2. |
| 1863 |
|
| 1864 |
2. There is no second ER-Hop, this indicates the end of the CR- |
| 1865 |
LSP. The ER-TLV is removed from the Label Request Message. |
| 1866 |
Processing continues with <a href="#section-4.8.2">Section 4.8.2</a>. |
| 1867 |
|
| 1868 |
At LSR4, the following processing of <a href="#section-4.8.2">Section 4.8.2</a> takes place: |
| 1869 |
Executing algorithm 4.8.1 resulted in the removal of the ER-TLV. LSR4 |
| 1870 |
does not add a new ER-TLV. |
| 1871 |
|
| 1872 |
Therefore, processing <a href="#section-4.8.2">section 4.8.2</a> does not result in the insertion |
| 1873 |
of new ER-Hops. This indicates the end of the CR-LSP and the |
| 1874 |
processing of the ER-TLV is completed at LSR4. |
| 1875 |
|
| 1876 |
At LSR4, processing of <a href="#section-3.2">Section 3.2</a> is invoked. The first condition |
| 1877 |
is satisfied (LSR4 is the egress end of the CR-LSP and upstream |
| 1878 |
mapping has been requested). Therefore, a Label Mapping Message is |
| 1879 |
generated by LSR4 and sent to LSR3. |
| 1880 |
|
| 1881 |
At LSR3, the processing of <a href="#section-3.2">Section 3.2</a> is invoked. The second |
| 1882 |
condition is satisfied (LSR3 received a mapping from its downstream |
| 1883 |
next hop LSR4 for a CR-LSP for which an upstream request is still |
| 1884 |
pending). Therefore, a Label Mapping Message is generated by LSR3 |
| 1885 |
and sent to LSR2. |
| 1886 |
|
| 1887 |
At LSR2, a similar processing to LSR 3 takes place and a Label |
| 1888 |
Mapping Message is sent back to LSR1, which completes the end-to-end |
| 1889 |
CR-LSP setup. |
| 1890 |
|
| 1891 |
<span class="h3"><a class="selflink" id="appendix-A.2" href="#appendix-A.2">A.2</a> Node Groups and Specific Nodes Example</span> |
| 1892 |
|
| 1893 |
A request at ingress LSR to setup a CR-LSP might originate from a |
| 1894 |
management system or an application, the details are implementation |
| 1895 |
specific. |
| 1896 |
|
| 1897 |
|
| 1898 |
|
| 1899 |
|
| 1900 |
<span class="grey">Jamoussi, et al. Standards Track [Page 34]</span></pre> |
| 1901 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-35" ></span> |
| 1902 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1903 |
|
| 1904 |
|
| 1905 |
The ingress LSR uses information provided by the management system or |
| 1906 |
the application and possibly also information from the routing |
| 1907 |
database to calculate the explicit route and to create the Label |
| 1908 |
Request Message. |
| 1909 |
|
| 1910 |
The Label request message carries together with other necessary |
| 1911 |
information an ER-TLV defining the explicitly routed path. In our |
| 1912 |
example the list of hops in the ER-Hop TLV is supposed to contain an |
| 1913 |
abstract node representing a group of nodes, an abstract node |
| 1914 |
representing a specific node, another abstract node representing a |
| 1915 |
group of nodes, and an abstract node representing a specific egress |
| 1916 |
point. |
| 1917 |
|
| 1918 |
In--{Group 1}--{Specific A}--{Group 2}--{Specific Out: B} |
| 1919 |
The ER-TLV contains four ER-Hop TLVs: |
| 1920 |
|
| 1921 |
1. An ER-Hop TLV that specifies a group of LSR valid for the first |
| 1922 |
abstract node representing a group of nodes (Group 1). |
| 1923 |
|
| 1924 |
2. An ER-Hop TLV that indicates the specific node (Node A). |
| 1925 |
|
| 1926 |
3. An ER-Hop TLV that specifies a group of LSRs valid for the |
| 1927 |
second abstract node representing a group of nodes (Group 2). |
| 1928 |
|
| 1929 |
4. An ER-Hop TLV that indicates the specific egress point for the |
| 1930 |
CR-LSP (Node B). |
| 1931 |
|
| 1932 |
All the ER-Hop TLVs are strictly routed nodes. |
| 1933 |
|
| 1934 |
The setup procedure for this CR-LSP works as follows: |
| 1935 |
|
| 1936 |
1. The ingress node sends the Label Request Message to a node |
| 1937 |
that is a member the group of nodes indicated in the first ER- |
| 1938 |
Hop TLV, following normal routing for the specific node (A). |
| 1939 |
|
| 1940 |
2. The node that receives the message identifies itself as part |
| 1941 |
of the group indicated in the first ER-Hop TLV, and that it is |
| 1942 |
not the specific node (A) in the second. Further it realizes |
| 1943 |
that the specific node (A) is not one of its next hops. |
| 1944 |
|
| 1945 |
3. It keeps the ER-Hop TLVs intact and sends a Label Request |
| 1946 |
Message to another node that is part of the group indicated in |
| 1947 |
the first ER-Hop TLV (Group 1), following normal routing for |
| 1948 |
the specific node (A). |
| 1949 |
|
| 1950 |
|
| 1951 |
|
| 1952 |
|
| 1953 |
|
| 1954 |
|
| 1955 |
|
| 1956 |
<span class="grey">Jamoussi, et al. Standards Track [Page 35]</span></pre> |
| 1957 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-36" ></span> |
| 1958 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 1959 |
|
| 1960 |
|
| 1961 |
4. The node that receives the message identifies itself as part |
| 1962 |
of the group indicated in the first ER-Hop TLV, and that it is |
| 1963 |
not the specific node (A) in the second ER-Hop TLV. Further |
| 1964 |
it realizes that the specific node (A) is one of its next |
| 1965 |
hops. |
| 1966 |
|
| 1967 |
5. It removes the first ER-Hop TLVs and sends a Label Request |
| 1968 |
Message to the specific node (A). |
| 1969 |
|
| 1970 |
6. The specific node (A) recognizes itself in the first ER-Hop |
| 1971 |
TLV. Removes the specific ER-Hop TLV. |
| 1972 |
|
| 1973 |
7. It sends a Label Request Message to a node that is a member of |
| 1974 |
the group (Group 2) indicated in the ER-Hop TLV. |
| 1975 |
|
| 1976 |
8. The node that receives the message identifies itself as part |
| 1977 |
of the group indicated in the first ER-Hop TLV, further it |
| 1978 |
realizes that the specific egress node (B) is one of its next |
| 1979 |
hops. |
| 1980 |
|
| 1981 |
9. It sends a Label Request Message to the specific egress node |
| 1982 |
(B). |
| 1983 |
|
| 1984 |
10. The specific egress node (B) recognizes itself as the egress |
| 1985 |
for the CR-LSP, it returns a Label Mapping Message, that will |
| 1986 |
traverse the same path as the Label Request Message in the |
| 1987 |
opposite direction. |
| 1988 |
|
| 1989 |
<span class="h2"><a class="selflink" id="appendix-B" href="#appendix-B">Appendix B</a>. QoS Service Examples</span> |
| 1990 |
|
| 1991 |
<span class="h3"><a class="selflink" id="appendix-B.1" href="#appendix-B.1">B.1</a> Service Examples</span> |
| 1992 |
|
| 1993 |
Construction of an end-to-end service is the result of the rules |
| 1994 |
enforced at the edge and the treatment that packets receive at the |
| 1995 |
network nodes. The rules define the traffic conditioning actions |
| 1996 |
that are implemented at the edge and they include policing with pass, |
| 1997 |
mark, and drop capabilities. The edge rules are expected to be |
| 1998 |
defined by the mutual agreements between the service providers and |
| 1999 |
their customers and they will constitute an essential part of the |
| 2000 |
SLA. Therefore edge rules are not included in the signaling |
| 2001 |
protocol. |
| 2002 |
|
| 2003 |
Packet treatment at a network node is usually referred to as the |
| 2004 |
local behavior. Local behavior could be specified in many ways. One |
| 2005 |
example for local behavior specification is the service frequency |
| 2006 |
introduced in <a href="#section-4.3.2.1">section 4.3.2.1</a>, together with the resource reservation |
| 2007 |
rules implemented at the nodes. |
| 2008 |
|
| 2009 |
|
| 2010 |
|
| 2011 |
|
| 2012 |
<span class="grey">Jamoussi, et al. Standards Track [Page 36]</span></pre> |
| 2013 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-37" ></span> |
| 2014 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2015 |
|
| 2016 |
|
| 2017 |
Edge rules and local behaviors can be viewed as the main building |
| 2018 |
blocks for the end-to-end service construction. The following table |
| 2019 |
illustrates the applicability of the building block approach for |
| 2020 |
constructing different services including those defined for ATM. |
| 2021 |
|
| 2022 |
Service PDR PBS CDR CBS EBS Service Conditioning |
| 2023 |
Examples Frequency Action |
| 2024 |
|
| 2025 |
DS S S =PDR =PBS 0 Frequent drop>PDR |
| 2026 |
|
| 2027 |
TS S S S S 0 Unspecified drop>PDR,PBS |
| 2028 |
mark>CDR,CBS |
| 2029 |
|
| 2030 |
BE inf inf inf inf 0 Unspecified - |
| 2031 |
|
| 2032 |
FRS S S CIR ~B_C ~B_E Unspecified drop>PDR,PBS |
| 2033 |
mark>CDR,CBS,EBS |
| 2034 |
|
| 2035 |
ATM-CBR PCR CDVT =PCR =CDVT 0 VeryFrequent drop>PCR |
| 2036 |
|
| 2037 |
ATM-VBR.3(rt) PCR CDVT SCR MBS 0 Frequent drop>PCR |
| 2038 |
mark>SCR,MBS |
| 2039 |
|
| 2040 |
ATM-VBR.3(nrt) PCR CDVT SCR MBS 0 Unspecified drop>PCR |
| 2041 |
mark>SCR,MBS |
| 2042 |
|
| 2043 |
ATM-UBR PCR CDVT - - 0 Unspecified drop>PCR |
| 2044 |
|
| 2045 |
ATM-GFR.1 PCR CDVT MCR MBS 0 Unspecified drop>PCR |
| 2046 |
|
| 2047 |
ATM-GFR.2 PCR CDVT MCR MBS 0 Unspecified drop>PCR |
| 2048 |
mark>MCR,MFS |
| 2049 |
|
| 2050 |
int-serv-CL p m r b 0 Frequent drop>p |
| 2051 |
drop>r,b |
| 2052 |
|
| 2053 |
S= User specified |
| 2054 |
|
| 2055 |
In the above table, the DS refers to a delay sensitive service where |
| 2056 |
the network commits to deliver with high probability user datagrams |
| 2057 |
at a rate of PDR with minimum delay and delay requirements. Datagrams |
| 2058 |
in excess of PDR will be discarded. |
| 2059 |
|
| 2060 |
The TS refers to a generic throughput sensitive service where the |
| 2061 |
network commits to deliver with high probability user datagrams at a |
| 2062 |
rate of at least CDR. The user may transmit at a rate higher than |
| 2063 |
CDR but datagrams in excess of CDR would have a lower probability of |
| 2064 |
being delivered. |
| 2065 |
|
| 2066 |
|
| 2067 |
|
| 2068 |
<span class="grey">Jamoussi, et al. Standards Track [Page 37]</span></pre> |
| 2069 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-38" ></span> |
| 2070 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2071 |
|
| 2072 |
|
| 2073 |
The BE is the best effort service and it implies that there are no |
| 2074 |
expected service guarantees from the network. |
| 2075 |
|
| 2076 |
<span class="h3"><a class="selflink" id="appendix-B.2" href="#appendix-B.2">B.2</a> Establishing CR-LSP Supporting Real-Time Applications</span> |
| 2077 |
|
| 2078 |
In this scenario the customer needs to establish an LSP for |
| 2079 |
supporting real-time applications such as voice and video. The |
| 2080 |
Delay-sensitive (DS) service is requested in this case. |
| 2081 |
|
| 2082 |
The first step is the specification of the traffic parameters in the |
| 2083 |
signaling message. The two parameters of interest to the DS service |
| 2084 |
are the PDR and the PBS and the user based on his requirements |
| 2085 |
specifies their values. Since all the traffic parameters are |
| 2086 |
included in the signaling message, appropriate values must be |
| 2087 |
assigned to all of them. For DS service, the CDR and the CBS values |
| 2088 |
are set equal to the PDR and the PBS respectively. An indication of |
| 2089 |
whether the parameter values are subject to negotiation is flagged. |
| 2090 |
|
| 2091 |
The transport characteristics of the DS service require Frequent |
| 2092 |
frequency to be requested to reflect the real-time delay requirements |
| 2093 |
of the service. |
| 2094 |
|
| 2095 |
In addition to the transport characteristics, both the network |
| 2096 |
provider and the customer need to agree on the actions enforced at |
| 2097 |
the edge. The specification of those actions is expected to be a |
| 2098 |
part of the service level agreement (SLA) negotiation and is not |
| 2099 |
included in the signaling protocol. For DS service, the edge action |
| 2100 |
is to drop packets that exceed the PDR and the PBS specifications. |
| 2101 |
The signaling message will be sent in the direction of the ER path |
| 2102 |
and the LSP is established following the normal LDP procedures. Each |
| 2103 |
LSR applies its admission control rules. If sufficient resources are |
| 2104 |
not available and the parameter values are subject to negotiation, |
| 2105 |
then the LSR could negotiate down the PDR, the PBS, or both. |
| 2106 |
|
| 2107 |
The new parameter values are echoed back in the Label Mapping |
| 2108 |
Message. LSRs might need to re-adjust their resource reservations |
| 2109 |
based on the new traffic parameter values. |
| 2110 |
|
| 2111 |
<span class="h3"><a class="selflink" id="appendix-B.3" href="#appendix-B.3">B.3</a> Establishing CR-LSP Supporting Delay Insensitive Applications</span> |
| 2112 |
|
| 2113 |
In this example we assume that a throughput sensitive (TS) service is |
| 2114 |
requested. For resource allocation the user assigns values for PDR, |
| 2115 |
PBS, CDR, and CBS. The negotiation flag is set if the traffic |
| 2116 |
parameters are subject to negotiation. |
| 2117 |
Since the service is delay insensitive by definition, the Unspecified |
| 2118 |
frequency is signaled to indicate that the service frequency is not |
| 2119 |
an issue. |
| 2120 |
|
| 2121 |
|
| 2122 |
|
| 2123 |
|
| 2124 |
<span class="grey">Jamoussi, et al. Standards Track [Page 38]</span></pre> |
| 2125 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-39" ></span> |
| 2126 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2127 |
|
| 2128 |
|
| 2129 |
Similar to the previous example, the edge actions are not subject for |
| 2130 |
signaling and are specified in the service level agreement between |
| 2131 |
the user and the network provider. |
| 2132 |
|
| 2133 |
For TS service, the edge rules might include marking to indicate high |
| 2134 |
discard precedence values for all packets that exceed CDR and the |
| 2135 |
CBS. The edge rules will also include dropping of packets that |
| 2136 |
conform to neither PDR nor PBS. |
| 2137 |
|
| 2138 |
Each LSR of the LSP is expected to run its admission control rules |
| 2139 |
and negotiate traffic parameters down if sufficient resources do not |
| 2140 |
exist. The new parameter values are echoed back in the Label Mapping |
| 2141 |
Message. LSRs might need to re-adjust their resources based on the |
| 2142 |
new traffic parameter values. |
| 2143 |
|
| 2144 |
<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. Author's Addresses</span> |
| 2145 |
|
| 2146 |
Loa Andersson |
| 2147 |
Utfors Bredband AB |
| 2148 |
Rasundavagen 12 169 29 |
| 2149 |
Solna |
| 2150 |
Phone: +46 8 5270 50 38 |
| 2151 |
EMail: [email protected] |
| 2152 |
|
| 2153 |
Ross Callon |
| 2154 |
Juniper Networks |
| 2155 |
1194 North Mathilda Avenue, |
| 2156 |
Sunnyvale, CA 94089 |
| 2157 |
Phone: 978-692-6724 |
| 2158 |
EMail: [email protected] |
| 2159 |
|
| 2160 |
Ram Dantu |
| 2161 |
Netrake Corporation |
| 2162 |
3000 Technology Drive, #100 |
| 2163 |
Plano Texas, 75024 |
| 2164 |
Phone: 214 291 1111 |
| 2165 |
EMail: [email protected] |
| 2166 |
|
| 2167 |
Paul Doolan |
| 2168 |
On The Beach Consulting Corp |
| 2169 |
34 Mill Pond Circle |
| 2170 |
Milford MA 01757 |
| 2171 |
Phone 617 513 852 |
| 2172 |
EMail: [email protected] |
| 2173 |
|
| 2174 |
|
| 2175 |
|
| 2176 |
|
| 2177 |
|
| 2178 |
|
| 2179 |
|
| 2180 |
<span class="grey">Jamoussi, et al. Standards Track [Page 39]</span></pre> |
| 2181 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-40" ></span> |
| 2182 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2183 |
|
| 2184 |
|
| 2185 |
Nancy Feldman |
| 2186 |
IBM Research |
| 2187 |
30 Saw Mill River Road |
| 2188 |
Hawthorne, NY 10532 |
| 2189 |
Phone: 914-784-3254 |
| 2190 |
EMail: [email protected] |
| 2191 |
|
| 2192 |
Andre Fredette |
| 2193 |
ANF Consulting |
| 2194 |
62 Duck Pond Dr. |
| 2195 |
Groton, MA 01450 |
| 2196 |
EMail: [email protected] |
| 2197 |
|
| 2198 |
Eric Gray |
| 2199 |
600 Federal Drive |
| 2200 |
Andover, MA 01810 |
| 2201 |
Phone: (978) 689-1610 |
| 2202 |
EMail: [email protected] |
| 2203 |
|
| 2204 |
Juha Heinanen |
| 2205 |
Song Networks, Inc. |
| 2206 |
Hallituskatu 16 |
| 2207 |
33200 Tampere, Finland |
| 2208 |
EMail: [email protected] |
| 2209 |
|
| 2210 |
Bilel Jamoussi |
| 2211 |
Nortel Networks |
| 2212 |
600 Technology Park Drive |
| 2213 |
Billerica, MA 01821 |
| 2214 |
USA |
| 2215 |
Phone: +1 978 288-4506 |
| 2216 |
Mail: [email protected] |
| 2217 |
|
| 2218 |
Timothy E. Kilty |
| 2219 |
Island Consulting |
| 2220 |
Phone: (978) 462 7091 |
| 2221 |
EMail: [email protected] |
| 2222 |
|
| 2223 |
Andrew G. Malis |
| 2224 |
Vivace Networks |
| 2225 |
2730 Orchard Parkway |
| 2226 |
San Jose, CA 95134 |
| 2227 |
Phone: +1 408 383 7223 |
| 2228 |
EMail: [email protected] |
| 2229 |
|
| 2230 |
|
| 2231 |
|
| 2232 |
|
| 2233 |
|
| 2234 |
|
| 2235 |
|
| 2236 |
<span class="grey">Jamoussi, et al. Standards Track [Page 40]</span></pre> |
| 2237 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-41" ></span> |
| 2238 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2239 |
|
| 2240 |
|
| 2241 |
Muckai K Girish |
| 2242 |
Atoga Systems |
| 2243 |
49026 Milmont Drive |
| 2244 |
Fremont, CA 94538 |
| 2245 |
EMail: [email protected] |
| 2246 |
|
| 2247 |
Tom Worster |
| 2248 |
Phone: 617 247 2624 |
| 2249 |
EMail: [email protected] |
| 2250 |
|
| 2251 |
Liwen Wu |
| 2252 |
Cisco Systems |
| 2253 |
250 Apollo Drive |
| 2254 |
Chelmsford, MA. 01824 |
| 2255 |
Phone: 978-244-3087 |
| 2256 |
EMail: [email protected] |
| 2257 |
|
| 2258 |
|
| 2259 |
|
| 2260 |
|
| 2261 |
|
| 2262 |
|
| 2263 |
|
| 2264 |
|
| 2265 |
|
| 2266 |
|
| 2267 |
|
| 2268 |
|
| 2269 |
|
| 2270 |
|
| 2271 |
|
| 2272 |
|
| 2273 |
|
| 2274 |
|
| 2275 |
|
| 2276 |
|
| 2277 |
|
| 2278 |
|
| 2279 |
|
| 2280 |
|
| 2281 |
|
| 2282 |
|
| 2283 |
|
| 2284 |
|
| 2285 |
|
| 2286 |
|
| 2287 |
|
| 2288 |
|
| 2289 |
|
| 2290 |
|
| 2291 |
|
| 2292 |
<span class="grey">Jamoussi, et al. Standards Track [Page 41]</span></pre> |
| 2293 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-42" ></span> |
| 2294 |
<span class="grey"><a href="./rfc3212">RFC 3212</a> Constraint-Based LSP Setup using LDP January 2002</span> |
| 2295 |
|
| 2296 |
|
| 2297 |
Full Copyright Statement |
| 2298 |
|
| 2299 |
Copyright (C) The Internet Society (2002). All Rights Reserved. |
| 2300 |
|
| 2301 |
This document and translations of it may be copied and furnished to |
| 2302 |
others, and derivative works that comment on or otherwise explain it |
| 2303 |
or assist in its implementation may be prepared, copied, published |
| 2304 |
and distributed, in whole or in part, without restriction of any |
| 2305 |
kind, provided that the above copyright notice and this paragraph are |
| 2306 |
included on all such copies and derivative works. However, this |
| 2307 |
document itself may not be modified in any way, such as by removing |
| 2308 |
the copyright notice or references to the Internet Society or other |
| 2309 |
Internet organizations, except as needed for the purpose of |
| 2310 |
developing Internet standards in which case the procedures for |
| 2311 |
copyrights defined in the Internet Standards process must be |
| 2312 |
followed, or as required to translate it into languages other than |
| 2313 |
English. |
| 2314 |
|
| 2315 |
The limited permissions granted above are perpetual and will not be |
| 2316 |
revoked by the Internet Society or its successors or assigns. |
| 2317 |
|
| 2318 |
This document and the information contained herein is provided on an |
| 2319 |
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING |
| 2320 |
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING |
| 2321 |
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION |
| 2322 |
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF |
| 2323 |
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. |
| 2324 |
|
| 2325 |
Acknowledgement |
| 2326 |
|
| 2327 |
Funding for the RFC Editor function is currently provided by the |
| 2328 |
Internet Society. |
| 2329 |
|
| 2330 |
|
| 2331 |
|
| 2332 |
|
| 2333 |
|
| 2334 |
|
| 2335 |
|
| 2336 |
|
| 2337 |
|
| 2338 |
|
| 2339 |
|
| 2340 |
|
| 2341 |
|
| 2342 |
|
| 2343 |
|
| 2344 |
|
| 2345 |
|
| 2346 |
|
| 2347 |
|
| 2348 |
Jamoussi, et al. Standards Track [Page 42] |
| 2349 |
</pre> |