idnits 2.17.1 draft-jiyf-ccamp-lsp-03.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- ** The document seems to lack an IANA Considerations section. (See Section 2.2 of https://www.ietf.org/id-info/checklist for how to handle the case when there are no actions for IANA.) Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year -- The document date (April 19, 2012) is 4361 days in the past. Is this intentional? Checking references for intended status: Informational ---------------------------------------------------------------------------- == Unused Reference: 'RFC3473' is defined on line 562, but no explicit reference was found in the text == Unused Reference: 'RFC3945' is defined on line 566, but no explicit reference was found in the text == Unused Reference: 'RFC4206' is defined on line 569, but no explicit reference was found in the text == Unused Reference: 'RFC4655' is defined on line 573, but no explicit reference was found in the text == Unused Reference: 'RFC5150' is defined on line 576, but no explicit reference was found in the text == Unused Reference: 'RFC5440' is defined on line 581, but no explicit reference was found in the text == Unused Reference: 'RFC5441' is defined on line 585, but no explicit reference was found in the text == Unused Reference: 'RFC5814' is defined on line 590, but no explicit reference was found in the text == Unused Reference: 'I-D.ietf-ccamp-wson-impairments' is defined on line 596, but no explicit reference was found in the text == Unused Reference: 'Interdomain-LSP' is defined on line 602, but no explicit reference was found in the text == Unused Reference: 'RFC5212' is defined on line 607, but no explicit reference was found in the text -- No information found for draft-ietf-ccamp-wson-impairments - is the name correct? Summary: 1 error (**), 0 flaws (~~), 12 warnings (==), 2 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Network Working Group YF. Ji 3 Internet-Draft WW. Bian 4 Intended status: Informational HX. Wang 5 Expires: October 21, 2012 SG. Huang 6 BUPT 7 GY. Zhang 8 CATR 9 April 19, 2012 11 Performance Measurement Metrics of Label Switched Path (LSP) 12 Establishment in Multi-Layer and Multi-Domain Networks 13 draft-jiyf-ccamp-lsp-03 15 Abstract 17 As the increment of network scale, optical networks need to be 18 partitioned into multi-layer and multi-domain networks for the 19 purpose of better management. Meanwhile, as the variety of user 20 requests, different LSPs need to be established. In order to meet 21 different requirements of users, the LSP establishment performance is 22 necessary to be measured in multi-layer and multi-domain networks. 23 For this reason, typical performance measurement metrics need to be 24 proposed. In this document, the LSP establishment delay and bit 25 error ratio (BER), which are both as the performance measurement 26 metrics, are illustrated, and the definition and methodologies are 27 proposed. 29 Status of this Memo 31 This Internet-Draft is submitted in full conformance with the 32 provisions of BCP 78 and BCP 79. 34 Internet-Drafts are working documents of the Internet Engineering 35 Task Force (IETF). Note that other groups may also distribute 36 working documents as Internet-Drafts. The list of current Internet- 37 Drafts is at http://datatracker.ietf.org/drafts/current/. 39 Internet-Drafts are draft documents valid for a maximum of six months 40 and may be updated, replaced, or obsoleted by other documents at any 41 time. It is inappropriate to use Internet-Drafts as reference 42 material or to cite them other than as "work in progress." 44 This Internet-Draft will expire on October 21, 2012. 46 Copyright Notice 48 Copyright (c) 2012 IETF Trust and the persons identified as the 49 document authors. All rights reserved. 51 This document is subject to BCP 78 and the IETF Trust's Legal 52 Provisions Relating to IETF Documents 53 (http://trustee.ietf.org/license-info) in effect on the date of 54 publication of this document. Please review these documents 55 carefully, as they describe your rights and restrictions with respect 56 to this document. Code Components extracted from this document must 57 include Simplified BSD License text as described in Section 4.e of 58 the Trust Legal Provisions and are provided without warranty as 59 described in the Simplified BSD License. 61 Table of Contents 63 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4 64 1.1. Requirements Language . . . . . . . . . . . . . . . . . . 4 65 1.2. Terminology . . . . . . . . . . . . . . . . . . . . . . . 4 66 2. Overview of the Performance Measurement Metrics of LSP 67 Establishment . . . . . . . . . . . . . . . . . . . . . . . . 5 68 2.1. Overview of the LSP Establishment Delay . . . . . . . . . 5 69 2.2. Overview of the LSP Establishment BER . . . . . . . . . . 5 70 3. Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . 6 71 4. The LSP Establishment Delay in Multi-Layer and 72 Multi-Domain Networks . . . . . . . . . . . . . . . . . . . . 7 73 4.1. Measurement Metric Parameters . . . . . . . . . . . . . . 7 74 4.2. Definition . . . . . . . . . . . . . . . . . . . . . . . . 7 75 4.2.1. A Definition in Single Layer and Multi-Domain 76 Networks . . . . . . . . . . . . . . . . . . . . . . . 7 77 4.2.2. A Definition in Multi-Layer and Multi-Domain 78 Networks . . . . . . . . . . . . . . . . . . . . . . . 8 79 4.2.3. A Definition in Other Networks . . . . . . . . . . . . 10 80 4.3. Discussion . . . . . . . . . . . . . . . . . . . . . . . . 10 81 5. The LSP Establishment BER in Multi-Domain Networks . . . . . . 10 82 5.1. General Assumptions . . . . . . . . . . . . . . . . . . . 10 83 5.2. Definition . . . . . . . . . . . . . . . . . . . . . . . . 11 84 6. Methodologies . . . . . . . . . . . . . . . . . . . . . . . . 11 85 6.1. Definition . . . . . . . . . . . . . . . . . . . . . . . . 11 86 6.2. Methodologies . . . . . . . . . . . . . . . . . . . . . . 12 87 6.2.1. The LSP Establishment Delay . . . . . . . . . . . . . 12 88 6.2.2. The LSP Establishment BER . . . . . . . . . . . . . . 12 89 7. Protocol Extension Requirements . . . . . . . . . . . . . . . 13 90 8. Security Considerations . . . . . . . . . . . . . . . . . . . 13 91 9. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 13 92 10. References . . . . . . . . . . . . . . . . . . . . . . . . . . 14 93 10.1. Normative References . . . . . . . . . . . . . . . . . . . 14 94 10.2. Informative References . . . . . . . . . . . . . . . . . . 14 95 Appendix A. Other Authors . . . . . . . . . . . . . . . . . . . . 15 96 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 15 98 1. Introduction 100 As the increment of network scale and the variety of user request, 101 optical networks need to be partitioned into multi-layer and multi- 102 domain networks for the purpose of better management and different 103 LSPs need to be established in order to meet different requirements 104 of users. To measure whether a LSP establishment meets a user 105 requirement or not in multi-layer and multi-domain networks, some 106 objective performance measurement metrics and methodologies are 107 proposed, which are the delay and the BER in this document. In 108 previous IETF documents, RFC 5814 provided a series of performance 109 metrics to evaluate the dynamic LSP provisioning performance in GMPLS 110 networks, specifically the dynamic unidirectional and bidirectional 111 LSP setup/release delay, while in this document, the measurement of 112 LSP setup delay is extended into multi-layer and multi-domain 113 networks and the path computation delay and the LSP setup BER are 114 supplemented as the performance measurement metrics in the LSP 115 establishment process. 117 This document defines the performance measurement metrics and 118 methodologies that can be used to measure the LSP establishment 119 quality in multi-layer and multi-domain networks. 121 1.1. Requirements Language 123 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 124 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this 125 document are to be interpreted as described in [RFC2119]. 127 1.2. Terminology 129 BER: Bit Error Ratio. 131 BRPC: Backward-Recursive PCE-Based Computation. 133 GMPLS: Generalized Multiprotocol Label Switching. 135 LID: Local Information Database. 137 LSP: Label Switched Path. 139 PCE: Path Computation Element. 141 VSPT: Virtual Shortest Path Tree. 143 2. Overview of the Performance Measurement Metrics of LSP Establishment 145 2.1. Overview of the LSP Establishment Delay 147 In the LSP establishment process, delay is considered as one of the 148 main performance measurement metrics. In this document, the LSP 149 establishment delay is divided into two parts, which are the path 150 computation delay and the LSP setup delay. 152 In multi-layer and multi-domain networks, owing to the complexity of 153 path computation, the PCE-based path computation scheme is 154 considered. Furthermore, as the optimal inter-domain LSP can not be 155 obtained from a per-domain way, so the BRPC method is considered to 156 accomplish the inter-domain path computation in this document. The 157 path computation delay is approximately defined from the time that 158 source node sends the path computation request to the time that 159 source node receives the optimal path computation result. 161 In multi-layer and multi-domain networks, the end-to-end LSP setup is 162 considered in this document. In GMPLS networks, multiple LSPs that 163 have different granularities are set up. Therefore, for the purpose 164 of utilizing network resource more efficiently, two typical LSP setup 165 methods are employed: LSP nesting and LSP stitching. The LSP setup 166 delay is approximately defined from the time that source node sends 167 the LSP setup message to the time that source node receives the 168 confirmation message of switch reversing function of all nodes. 170 2.2. Overview of the LSP Establishment BER 172 There is a possibility that the physical link is not established 173 successfully after signaling accomplishes the LSP setup owing to the 174 optical signal quality degradation, so in order to measure the LSP 175 establishment performance more completely, the physical impairment 176 parameter is also considered in this document. BER is the epitome of 177 all of physical impairment parameters, so BER is considered as one of 178 the main performance measurement metrics in the LSP establishment 179 process. 181 In the measurement process of the LSP establishment BER, BRPC method 182 is used for the path computation and end-to-end way is used for the 183 LSP setup, and BER is evaluated in the LSP setup process. The 184 approximate procedure is as follows: the signaling collects some 185 physical parameter information from source node to destination node 186 in the first place, and then the destination node evaluates the LSP 187 establishment performance. If the computed BER meets the requirement 188 of a user and is lower than specific threshold, then destination node 189 returns Resv message to set up the LSP, otherwise, LSP setup fails. 191 3. Motivation 193 The LSP establishment delay in multi-layer and multi-domain networks 194 is useful for several reasons: 196 o Average LSP establishment delay is an important performance 197 measurement metric that MAY reflect the scalability of a multi- 198 layer and multi-domain network to a certain extent. Longer LSP 199 establishment delay with the increasing numbers of domains and 200 nodes or traffic loads will most likely show that the network 201 scalability is not good, especially when the delay curve of LSP 202 establishment surpass linear change with the increasing numbers of 203 domains and nodes or traffic loads. 205 o The LSP establishment delay is an important performance 206 measurement metric that MAY reflect the LSP establishment quality 207 in multi-layer and multi-domain networks. Longer LSP 208 establishment delay will most likely show that the LSP 209 establishment quality is not good. 211 o The values of LSP establishment delay in the samples MAY serve as 212 an early indicator to provide references on whether to accept a 213 service request that has the stringent requirement of LSP 214 establishment delay or not. 216 The LSP establishment BER in multi-domain networks is useful for 217 several reasons: 219 o The LSP establishment BER can decide whether the physical path is 220 established successfully or not. If the values of LSP 221 establishment BER are higher than specific threshold, then the 222 physical path establishment still fails even though the LSP 223 establishment succeeds. 225 o The LSP establishment BER is an important performance measurement 226 metric that MAY reflect the LSP establishment quality in multi- 227 domain networks. Higher LSP establishment BER will most likely 228 show that the LSP establishment quality is not good. 230 o The values of LSP establishment BER in the samples MAY serve as an 231 early indicator to provide references on whether to accept a 232 service request that has the stringent requirement of LSP 233 establishment BER or not. 235 4. The LSP Establishment Delay in Multi-Layer and Multi-Domain Networks 237 This section integrally defines a performance measurement metric 238 named the LSP establishment delay in multi-layer and multi-domain 239 networks. 241 4.1. Measurement Metric Parameters 243 o ID0, the source node ID. 245 o ID1, the destination node ID. 247 o T0, a time when the path computation is attempted. 249 o T1, a time when the LSP setup is attempted. 251 4.2. Definition 253 4.2.1. A Definition in Single Layer and Multi-Domain Networks 255 In single layer and multi-domain networks, the LSP establishment 256 delay is collected from two parts: the path computation delay and the 257 LSP setup delay. 259 The detailed path computation process from source node ID0 to 260 destination node ID1 is as follows: ID0 sends a Req message of path 261 computation to the PCE which is responsible for the path computation 262 of source domain. This request is forwarded between PCEs, domain-by- 263 domain, until to the PCE which is responsible for the path 264 computation of destination domain. The PCE in the destination domain 265 computes a set of optimal paths from all of the domain ingress nodes 266 to the destination node. This set is represented as a tree of 267 potential paths called the VSPT, and the PCE in the destination 268 domain passes it back to the previous PCE in a Rep message. Each PCE 269 in turn adds the computed set of optimal paths to the VSPT and passes 270 it back until the PCE in the source domain uses the VSPT to select an 271 optimal end-to-end path from the tree, and returns the path to the 272 source node. The above BRPC procedure makes an assumption that the 273 sequence of domains is known in advance. The path computation delay 274 from source node ID0 to destination node ID1 is dT means that ID0 275 sends the Req message of path computation to the PCE which is 276 responsible for the source domain at time T0, and that ID0 receives 277 the path computation results from the PCE which is responsible for 278 the source domain at time T0+dT. 280 The detailed LSP setup process from source node ID0 to destination 281 node ID1 is as follows: ID0 sends the LSP setup message, which 282 includes two steps: establishing the service layer and sending the 283 Path message, that is, ID0 firstly establishes a service layer 284 through using signaling function, then ID0 sends Path message to 285 determine an available wavelength until this Path message arrives at 286 ID1. If the available wavelength exists, then ID1 returns Resv 287 message to ID0 to reserve available resources and the switch 288 reversing function of corresponding nodes is also carried out 289 simultaneously, otherwise, PathErr message is returned to ID0. When 290 a service layer exists, if any node which Path message traverses 291 detects the unavailable service layer, then PathErr message is also 292 returned to ID0. The LSP setup delay from source node ID0 to 293 destination node ID1 is dT means that ID0 sends the LSP setup message 294 at time T1, and that ID0 receives the LSP confirmation message of 295 switch reversing function of all nodes at time T1+dT. 297 The value of LSP establishment delay in single layer and multi-domain 298 networks is a real number of milliseconds. 300 There is another case in which source node ID0 does not receive the 301 optimal path computation result or the LSP confirmation message of 302 switch reversing function of all nodes within a reasonable period of 303 time, then the value of LSP establishment delay in this case is 304 marked undefined. 306 4.2.2. A Definition in Multi-Layer and Multi-Domain Networks 308 In multi-layer and multi-domain networks, LSP can be established 309 using the LSP nesting and stitching methods. In this process, the 310 LSP establishment delay is collected from two parts: the path 311 computation delay and the LSP setup delay. 313 The detailed path computation process from source node ID0 to 314 destination node ID1 is as follows: ID0 sends a Req message of path 315 computation to the PCE which is responsible for the source domain. 316 This request is forwarded between PCEs, domain-by-domain, until to 317 the PCE which is responsible for the destination domain. The PCE in 318 the destination domain computes a set of optimal paths from all of 319 the domain ingress nodes to the destination node. This set is 320 represented as a tree of potential paths called the VSPT, and the PCE 321 in the destination domain passes it back to the previous PCE in a Rep 322 message. Each PCE in turn adds the computed set of optimal paths to 323 the VSPT and passes it back until the PCE in the source domain uses 324 the VSPT to select an optimal end-to-end path from the tree, and 325 returns the optimal path to ID0. The above BRPC procedure makes an 326 assumption that the sequence of domains is known in advance. The 327 path computation delay from source node ID0 to destination node ID1 328 is dT means that ID0 sends the Req message of path computation to the 329 PCE which is responsible for the source domain at time T0, and that 330 ID0 receives the path computation results from the PCE which is 331 responsible for the source domain at time T0+dT. 333 The detailed LSP setup process from source node ID0 to destination 334 node ID1 is as follows: ID0 sends the LSP setup message, which 335 includes two steps: determining if the service layer exists and 336 sending the Path message, that is, ID0 firstly determines if service 337 layers exist. If service layers exist, ID0 sends Path message to the 338 next node to collects available wavelength resources, and the next 339 node carries out the same function like ID0 until Path message 340 arrives at ID1, which selects any available wavelength. If any 341 available wavelength exists, ID1 returns Resv message to the ID0 in 342 order to accomplish the process of resource reservation, and 343 meanwhile, the switch reversing function of corresponding nodes are 344 also carried out, otherwise, PathErr message is returned to the ID0. 345 If the capacity of existing service layer is not fully occupied, then 346 the fine granularity service that capacity is no more than remaining 347 capacity of existing service layer can still be accepted in this 348 service layer. If service layers do not exist, ID0 firstly 349 establishes a service layer through using signaling function, then 350 ID0 sends Path message to determine an available wavelength until 351 this Path message arrives at destination node. If the available 352 wavelength exists, then ID1 sends Resv message to ID0 to reserve 353 available resources and the switch reversing function of 354 corresponding nodes are also carried out simultaneously, otherwise, 355 PathErr message is returned to ID0. When a service layer exists, if 356 any node which Path message traverses detects the unavailable service 357 layer, then PathErr message is also returned to ID0. If the capacity 358 of new established service layer is not fully occupied, then the fine 359 granularity service that capacity is no more than remaining capacity 360 of new established service layer can still be accepted in this 361 service layer. The complete LSP nesting and stitching processes can 362 be obtained from RFC 4206 and RFC 5150, respectively. The LSP setup 363 delay from source node ID0 to destination node ID1 is dT means that 364 ID0 sends the LSP setup message at time T1, and that ID0 receives the 365 LSP confirmation message of switch reversing function of all nodes at 366 time T1+dT. 368 The value of LSP establishment delay in multi-layer and multi-domain 369 networks is a real number of milliseconds. 371 There is another case in which source node ID0 does not receive the 372 optimal path computation result or the LSP confirmation message of 373 switch reversing function of all nodes within a reasonable period of 374 time, then the value of LSP establishment delay in this case is 375 marked undefined. 377 4.2.3. A Definition in Other Networks 379 There are still two forms of other networks: single layer and single 380 domain networks and multi-layer and single domain networks. The 381 definition in single layer and single domain networks is similar to 382 the definition in single layer and multi-domain networks, and the 383 difference is that the inter-domain LSP establishment process in 384 single layer and single domain networks is not considered. 385 Correspondingly, the definition in multi-layer and single domain 386 networks is similar to the definition in multi-layer and multi-domain 387 networks, and the difference is that the inter-domain LSP 388 establishment process in multi-layer and single domain networks is 389 not considered. 391 The value of LSP establishment delay in single layer and single 392 domain networks and multi-layer and single domain networks is a real 393 number of milliseconds. 395 There is another case in which ID0 does not receive the optimal path 396 computation result or the LSP confirmation message of switch 397 reversing function of all nodes within a reasonable period of time, 398 then the value of LSP establishment delay in this case is marked 399 undefined. 401 4.3. Discussion 403 The reason that the LSP establishment delay is set to undefined not 404 only lies in that source node ID0 never receives the corresponding 405 reply message within a reasonable period of time, but also consists 406 in that source node ID0 receives the PathErr message. There are many 407 possible reasons for receiving the PathErr message, for example, the 408 network does not have enough resources to establish the service layer 409 for the user requests or the network element failure occurs. 411 5. The LSP Establishment BER in Multi-Domain Networks 413 This section integrally defines a performance measurement metric 414 named the LSP establishment BER in multi-domain networks. 416 5.1. General Assumptions 418 o ID0, the source node ID. 420 o ID1, the destination node ID. 422 o Every node has a LID which stores the node physical information. 424 o Destination node has a performance evaluation module which can 425 evaluate the LSP establishment BER through combining corresponding 426 physical parameter information. 428 5.2. Definition 430 In the measurement process of the LSP establishment BER, whether the 431 network is single domain or multi-domain, the evaluation method is 432 the same, meanwhile, only the wavelength lightpath has physical 433 parameters, so the single layer and multi-domain network is 434 considered. 436 In multi-domain networks, the physical parameters are collected and 437 measured in the LSP setup process, so only the LSP setup process is 438 considered in this section. 440 The detailed LSP setup process from source node ID0 to destination 441 node ID1 is as follows: ID0 firstly establishes a service layer 442 through using signaling function, then ID0 sends Path message to 443 determine an available wavelength until Path message arrives at ID1. 444 Meanwhile, signaling message collects physical information of nodes 445 and links. If the available wavelength exists and the computed BER 446 by ID1 is within the tolerable range, then ID1 sends Resv message to 447 ID0 to reserve available resources and the switch reversing function 448 of corresponding nodes are also carried out simultaneously, 449 otherwise, PathErr message is returned to ID0 and LSP setup fails. 450 When the service layer exists, if any node which Path message 451 traverses detects the unavailable service layer, then PathErr message 452 is also returned to ID0 and LSP setup fails. 454 6. Methodologies 456 6.1. Definition 458 o T0, a time when the path computation is attempted. 460 o T1, a time when the LSP setup is attempted. 462 o T2, a time when the optimal path computation result is returned. 464 o T3, a time when the LSP confirm message of successful reservation 465 is returned. 467 6.2. Methodologies 469 6.2.1. The LSP Establishment Delay 471 o Make sure that the PCE has enough computation ability to compute 472 the path that conforms to user request. 474 o Make sure that the network has enough resources to establish the 475 requested path. 477 o At the source node, the Req message of path computation is formed. 478 A timestamp (T0) may be stored locally on the source node when the 479 Req message of path computation is sent towards the PCE which is 480 responsible for the source domain, and a timestamp (T1) may be 481 stored locally on the source node when the LSP setup message is 482 sent. 484 o If the corresponding end-to-end path computation results and the 485 Resv message arrive at source node within a reasonable period of 486 time, taking the timestamp (T2) and timestamp (T3) upon receipt of 487 the messages. By subtracting the two timestamps, the estimation 488 value of the delay of path computation (T2-T0) and the delay of 489 LSP setup (T3-T1) can be computed. 491 o If the corresponding end-to-end path computation results and the 492 Resv message fail to arrive at source node within a reasonable 493 period of time, the path computation delay and the LSP setup delay 494 are considered to be undefined. 496 o If the corresponding response is the PathErr message, then the 497 path computation delay and the LSP setup delay are considered to 498 be undefined. 500 6.2.2. The LSP Establishment BER 502 o Make sure that the PCE has enough computation ability to compute 503 the path that conforms to user request. 505 o Make sure that the network has enough resources to establish the 506 requested path. 508 o In the path computation process, BRPC is used as the computation 509 method. 511 o In the LSP setup process, when Path message arrives at the 512 destination node, the destination node computes the BER through 513 combining the corresponding physical parameter information which 514 is collected from the traversing nodes and links. If the 515 available wavelength resource exists and the computed BER is 516 within the tolerable range, then Resv message is returned to the 517 source node. 519 o If the computed BER is outside the tolerable range, then the 520 PathErr message is returned to the source node and the LSP 521 establishment fails. 523 7. Protocol Extension Requirements 525 o In the measurement process of the LSP establishment delay, the 526 start time of LSP establishment and the end time need to be 527 determined using corresponding protocol. In the path computation 528 process, a new object that includes time stamp needs to be added 529 in routing protocol in order to record the start time of path 530 computation and the end time of path computation; In the process 531 of LSP setup, a new object that includes time stamp needs to be 532 added in signaling protocol in order to record the start time of 533 LSP setup and the end time of LSP setup. 535 o In the measurement process of the LSP establishment BER, the 536 physical information of nodes and links needs to be collected 537 using signaling protocol, and BER is evaluated in the destination 538 node through combining corresponding physical parameter 539 information, so a new object that includes network physical 540 parameters needs to be added in signaling protocol in order to 541 collect the physical information of nodes and links. 543 8. Security Considerations 545 This document involves some information collection about network 546 physical parameters. Such information would need to be protected 547 from intentional or unintentional disclosure. 549 9. Acknowledgments 551 We wish to thank Yongli Zhao, Linna Xia, Haoyuan Lin, Hongrui Han for 552 their comments and help. 554 The RFC text was produced using Marshall Rose's xml2rfc tool. 556 10. References 557 10.1. Normative References 559 [RFC2119] Bradner, S., "Key words for use in RFC's to Indicate 560 Requirement Levels", RFC 2119, March 1997. 562 [RFC3473] Berger, L., "Generalized Multi-Protocol Label Switching 563 (GMPLS) Signaling Resource ReserVation Protocol-Traffic 564 Engineering (RSVP-TE) Extensions", RFC 3473, January 2003. 566 [RFC3945] Eric, M., "Generalized Multi-Protocol Label Switching 567 (GMPLS) Architecture", RFC 3945, October 2004. 569 [RFC4206] Kompella, K. and Y. Rekhter, "Label Switched Path (LSP) 570 Hierarchy with Generalized Multi-Protocol Label Switching 571 (GMPLS) Traffic Engineering (TE)", RFC 4206, October 2005. 573 [RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation 574 Element (PCE)-Based Architecture", RFC 4655, August 2006. 576 [RFC5150] Ayyangar, A., Kompella, K., Vasseur, JP., and A. Farrel, 577 "Label Switched Path Stitching with Generalized 578 Multiprotocol Label Switching Traffic Engineering (GMPLS 579 TE)", RFC 5150, February 2008. 581 [RFC5440] Vasseur, J. and JL. Le Roux, "Path Computation Element 582 (PCE) Communication Protocol (PCEP)", RFC 5440, 583 March 2009. 585 [RFC5441] Vasseur, J., Zhang, R., Bitar, N., and JL. Le Roux, "A 586 Backward-Recursive PCE-Based Computation (BRPC) Procedure 587 to Compute Shortest Constrained Inter-Domain Traffic 588 Engineering Label Switched Paths", RFC 5441, April 2009. 590 [RFC5814] Sun, W. and G. Zhang, "Label Switched Path (LSP) Dynamic 591 Provisioning Performance Metrics in Generalized MPLS 592 Networks", RFC 5814, March 2010. 594 10.2. Informative References 596 [I-D.ietf-ccamp-wson-impairments] 597 Lee, Y., Bernstein, G., Li, D., and G. Martinelli, "The 598 Application of the Path Computation Element Architecture 599 to the Determination of a Sequence of Domains in MPLS & 600 GMPLS", July 2010. 602 [Interdomain-LSP] 603 Aslam, F., Uzmi, ZA., and A. Farrel, "Interdomain Path 604 Computation: Challenges and Solutions for Label Switched 605 Networks", IEEE Communications Magazine, October 2007. 607 [RFC5212] Shiomoto, K., Papadimitriou, D., Le Roux, JL., Vigoureu, 608 M., and D. Brungard, "Requirements for GMPLS-Based Multi- 609 Region and Multi-Layer Networks (MRN/MLN)", RFC 5212, 610 July 2008. 612 Appendix A. Other Authors 614 1. Min Zhang 616 BUPT 618 No.10,Xitucheng Road,Haidian District 620 Beijing 100876 622 P.R.China 624 Phone: +8613910621756 626 Email: mzhang@bupt.edu.cn 628 URI: http://www.bupt.edu.cn/ 630 2. Yunbin Xu 632 CATR 634 No.52 Hua Yuan Bei Lu,Haidian District 636 Beijing 100083 638 P.R.China 640 Phone: ++8613681485428 642 Email: xuyunbin@mail.ritt.com.cn 644 URI: http://www.bupt.edu.cn/ 646 Authors' Addresses 648 Yuefeng Ji 649 BUPT 650 No.10,Xitucheng Road,Haidian District 651 Beijing 100876 652 P.R.China 654 Phone: +8613701131345 655 Email: jyf@bupt.edu.cn 656 URI: http://www.bupt.edu.cn 658 Weiwei Bian 659 BUPT 660 No.10,Xitucheng Road,Haidian District 661 Beijing 100876 662 P.R.China 664 Phone: +8615210837998 665 Email: bianweiwei2008@163.com 666 URI: http://www.bupt.edu.cn/ 668 Hongxiang Wang 669 BUPT 670 No.10,Xitucheng Road,Haidian District 671 Beijing 100876 672 P.R.China 674 Phone: +8613683683550 675 Email: wanghx@bupt.edu.cn 676 URI: http://www.bupt.edu.cn/ 678 Shanguo Huang 679 BUPT 680 No.10,Xitucheng Road,Haidian District 681 Beijing 100876 682 P.R.China 684 Phone: +86 1062282048 685 Email: shghuang@bupt.edu.cn 686 URI: http://www.bupt.edu.cn/ 687 Guoying Zhang 688 CATR 689 No.52 Hua Yuan Bei Lu,Haidian District 690 Beijing 100083 691 P.R.China 693 Phone: +86 1062300103 694 Email: zhangguoying@mail.ritt.com.cn 695 URI: http://www.catr.cn/