draft-ietf-pce-applicability-actn-01.txt   draft-ietf-pce-applicability-actn-02.txt 
PCE Working Group D. Dhody PCE Working Group D. Dhody
Internet-Draft Y. Lee Internet-Draft Y. Lee
Intended status: Informational Huawei Technologies Intended status: Informational Huawei Technologies
Expires: December 31, 2017 D. Ceccarelli Expires: May 1, 2018 D. Ceccarelli
Ericsson Ericsson
June 29, 2017 October 28, 2017
Applicability of Path Computation Element (PCE) for Abstraction and Applicability of Path Computation Element (PCE) for Abstraction and
Control of TE Networks (ACTN) Control of TE Networks (ACTN)
draft-ietf-pce-applicability-actn-01 draft-ietf-pce-applicability-actn-02
Abstract Abstract
Abstraction and Control of TE Networks (ACTN) refers to the set of Abstraction and Control of TE Networks (ACTN) refers to the set of
virtual network operations needed to orchestrate, control and manage virtual network operations needed to orchestrate, control and manage
large-scale multi-domain TE networks so as to facilitate network large-scale multi-domain TE networks so as to facilitate network
programmability, automation, efficient resource sharing, and end-to- programmability, automation, efficient resource sharing, and end-to-
end virtual service aware connectivity and network function end virtual service aware connectivity and network function
virtualization services. virtualization services.
skipping to change at page 1, line 38 skipping to change at page 1, line 38
framework. framework.
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on December 31, 2017. This Internet-Draft will expire on May 1, 2018.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Path Computation Element (PCE) . . . . . . . . . . . . . 2 1.1. Path Computation Element (PCE) . . . . . . . . . . . . . 2
1.1.1. Role of PCE in SDN . . . . . . . . . . . . . . . . . 3 1.1.1. Role of PCE in SDN . . . . . . . . . . . . . . . . . 3
1.1.2. PCE in multi-domain and multi-layer deployments . . . 4 1.1.2. PCE in multi-domain and multi-layer deployments . . . 4
1.2. Abstraction and Control of TE Networks (ACTN) . . . . . . 4 1.2. Abstraction and Control of TE Networks (ACTN) . . . . . . 4
1.3. PCE and ACTN . . . . . . . . . . . . . . . . . . . . . . 5 1.3. PCE and ACTN . . . . . . . . . . . . . . . . . . . . . . 6
2. Architectural Considerations . . . . . . . . . . . . . . . . 6 2. Architectural Considerations . . . . . . . . . . . . . . . . 6
2.1. Multi domain coordination via Hierarchy . . . . . . . . . 6 2.1. Multi domain coordination via Hierarchy . . . . . . . . . 6
2.2. Virtualization/Abstraction function . . . . . . . . . . . 7 2.2. Virtualization/Abstraction function . . . . . . . . . . . 7
2.3. Customer mapping function . . . . . . . . . . . . . . . . 8 2.3. Customer mapping function . . . . . . . . . . . . . . . . 8
2.4. Virtual Network Operations . . . . . . . . . . . . . . . 8 2.4. Virtual Network Operations . . . . . . . . . . . . . . . 8
3. Interface Considerations . . . . . . . . . . . . . . . . . . 9 3. Interface Considerations . . . . . . . . . . . . . . . . . . 9
4. Realizining ACTN with PCE (and PCEP) . . . . . . . . . . . . 9 4. Realizining ACTN with PCE (and PCEP) . . . . . . . . . . . . 10
5. Relationship to PCE based central control . . . . . . . . . . 13 5. Relationship to PCE based central control . . . . . . . . . . 13
6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 13 6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 13
7. Security Considerations . . . . . . . . . . . . . . . . . . . 13 7. Security Considerations . . . . . . . . . . . . . . . . . . . 13
8. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 13 8. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 13
9. References . . . . . . . . . . . . . . . . . . . . . . . . . 13 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 13
9.1. Normative References . . . . . . . . . . . . . . . . . . 13 9.1. Normative References . . . . . . . . . . . . . . . . . . 14
9.2. Informative References . . . . . . . . . . . . . . . . . 14 9.2. Informative References . . . . . . . . . . . . . . . . . 14
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 17 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 17
1. Introduction 1. Introduction
1.1. Path Computation Element (PCE) 1.1. Path Computation Element (PCE)
The Path Computation Element communication Protocol (PCEP) [RFC5440] The Path Computation Element communication Protocol (PCEP) [RFC5440]
provides mechanisms for Path Computation Elements (PCEs) [RFC4655] to provides mechanisms for Path Computation Elements (PCEs) [RFC4655] to
perform path computations in response to Path Computation Clients perform path computations in response to Path Computation Clients
(PCCs) requests. (PCCs) requests.
The ability to compute shortest constrained TE LSPs in Multiprotocol The ability to compute shortest constrained TE LSPs in Multiprotocol
Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across
multiple domains has been identified as a key motivation for PCE multiple domains has been identified as a key motivation for PCE
development. development.
A stateful PCE is capable of considering, for the purposes of path A stateful PCE [RFC8231] is capable of considering, for the purposes
computation, not only the network state in terms of links and nodes of path computation, not only the network state in terms of links and
(referred to as the Traffic Engineering Database or TED) but also the nodes (referred to as the Traffic Engineering Database or TED) but
status of active services (previously computed paths, and currently also the status of active services (previously computed paths, and
reserved resources, stored in the Label Switched Paths Database currently reserved resources, stored in the Label Switched Paths
(LSPDB). Database (LSPDB).
[RFC8051] describes general considerations for a stateful PCE [RFC8051] describes general considerations for a stateful PCE
deployment and examines its applicability and benefits, as well as deployment and examines its applicability and benefits, as well as
its challenges and limitations through a number of use cases. its challenges and limitations through a number of use cases.
[I-D.ietf-pce-stateful-pce] describes a set of extensions to PCEP to [RFC8231] describes a set of extensions to PCEP to provide stateful
provide stateful control. A stateful PCE has access to not only the control. A stateful PCE has access to not only the information
information carried by the network's Interior Gateway Protocol (IGP), carried by the network's Interior Gateway Protocol (IGP), but also
but also the set of active paths and their reserved resources for its the set of active paths and their reserved resources for its
computations. The additional state allows the PCE to compute computations. The additional state allows the PCE to compute
constrained paths while considering individual LSPs and their constrained paths while considering individual LSPs and their
interactions. [I-D.ietf-pce-pce-initiated-lsp] describes the setup, interactions. [I-D.ietf-pce-pce-initiated-lsp] describes the setup,
maintenance and teardown of PCE-initiated LSPs under the stateful PCE maintenance and teardown of PCE-initiated LSPs under the stateful PCE
model. model.
[I-D.ietf-pce-stateful-pce] also describes the active stateful PCE. [RFC8231] also describes the active stateful PCE. The active PCE
The active PCE functionality allows a PCE to reroute an existing LSP functionality allows a PCE to reroute an existing LSP or make changes
or make changes to the attributes of an existing LSP, or a PCC to to the attributes of an existing LSP, or a PCC to delegate control of
delegate control of specific LSPs to a new PCE. specific LSPs to a new PCE.
1.1.1. Role of PCE in SDN 1.1.1. Role of PCE in SDN
Software-Defined Networking (SDN) refers to a separation between the Software-Defined Networking (SDN) refers to a separation between the
control elements and the forwarding components so that software control elements and the forwarding components so that software
running in a centralized system called a controller, can act to running in a centralized system called a controller, can act to
program the devices in the network to behave in specific ways. A program the devices in the network to behave in specific ways. A
required element in an SDN architecture is a component that plans how required element in an SDN architecture is a component that plans how
the network resources will be used and how the devices will be the network resources will be used and how the devices will be
programmed. It is possible to view this component as performing programmed. It is possible to view this component as performing
skipping to change at page 4, line 49 skipping to change at page 4, line 49
for the deployment of PCE in support of multi-layer networks. It for the deployment of PCE in support of multi-layer networks. It
also describes the relationship between PCE and a functional also describes the relationship between PCE and a functional
component in charge of the control and management of the VNT, called component in charge of the control and management of the VNT, called
the Virtual Network Topology Manager (VNTM). the Virtual Network Topology Manager (VNTM).
1.2. Abstraction and Control of TE Networks (ACTN) 1.2. Abstraction and Control of TE Networks (ACTN)
[I-D.ietf-teas-actn-requirements] describes the high-level ACTN [I-D.ietf-teas-actn-requirements] describes the high-level ACTN
requirements. [I-D.ietf-teas-actn-framework] describes the requirements. [I-D.ietf-teas-actn-framework] describes the
architecture model for ACTN including the entities (Customer Network architecture model for ACTN including the entities (Customer Network
Controller(CNC), Mult-domain Service Coordinator(MDSC), and Physical Controller(CNC), Mult-domain Service Coordinator(MDSC), and
Network Controller(PNC)) and their interfaces. Provisioning Network Controller (PNC) and their interfaces.
The ACTN reference architecture identified a three-tier control The ACTN reference architecture identified a three-tier control
hierarchy as depicted in Figure 1: hierarchy as depicted in Figure 1:
+-------+ +-------+ +-------+ +---------+ +---------+ +---------+
| CNC-A | | CNC-B | | CNC-C | | CNC | | CNC | | CNC |
+-------+ +-------+ +-------+ +---------+ +---------+ +---------+
\ | / \ | /
---------- |-CMI I/F ----------- Business \ | /
\ | / Boundary =============\==============|==============/============
+-----------------------+ Between \ | /
| MDSC | Customer & ------- | CMI -------
+-----------------------+ Network Provider \ | /
/ | \ +---------------+
---------- |-MMI I/F ----------- | MDSC |
/ | \ +---------------+
+----------+ +----------+ +--------+ / | \
| MDSC | | MDSC | | MDSC | ------------ | MPI -------------
+----------+ +----------+ +--------+ / | \
| / |-MPI I/F / \ +-------+ +-------+ +-------+
| / | / \ | PNC | | PNC | | PNC |
+-----+ +-----+ +-----+ +-----+ +-----+ +-------+ +-------+ +-------+
| PNC | | PNC | | PNC | | PNC | | PNC | | SBI / | / \
+-----+ +-----+ +-----+ +-----+ +-----+ | / | SBI / \
--------- ----- | / \
( ) ( ) | / \
- Control - ( Phys. ) | / -----
( Plane ) ( Net ) | / ( )
( Physical ) ----- | / ( Phys. )
( Network ) ----- ----- ( Net )
- - ( ) ( ) -----
( ) ( Phys. ) ( Phys. )
--------- ( Net ) ( Net )
----- -----
CMI - (CNC-MDSC Interface) CMI - (CNC-MDSC Interface)
MMI - (MDSC-MDSC Interface) MPI - (MDSC-PNC Interface)
MPI - (MDSC-PNC Interface)
Figure 1: ACTN Hierarchy Figure 1: ACTN Hierarchy
The two interfaces with respect to the MDSC, one north of the MDSC The two interfaces with respect to the MDSC, one north of the MDSC
Interface) and MPI (MDSC-PNC Interface), respectively. MMI (MDSC- Interface) and MPI (MDSC-PNC Interface), respectively. A hierarchy
MDSC interface) is used to support recursion. of MDSC is possible with a recursive MPI interface.
[I-D.ietf-teas-actn-info-model] provides an information model for [I-D.ietf-teas-actn-info-model] provides an information model for
ACTN interfaces. ACTN interfaces.
1.3. PCE and ACTN 1.3. PCE and ACTN
This document examines the PCE and ACTN architecture and describes This document examines the PCE and ACTN architecture and describes
how the PCE architecture is applicable to ACTN. It also lists the how the PCE architecture is applicable to ACTN. It also lists the
PCEP extensions that are needed to use PCEP as an ACTN interface. PCEP extensions that are needed to use PCEP as an ACTN interface.
This document also identifies any gaps in PCEP, that exist at the This document also identifies any gaps in PCEP, that exist at the
skipping to change at page 9, line 32 skipping to change at page 9, line 44
from the Customer Network Controller. from the Customer Network Controller.
o The MDSC-PNC Interface (MPI) is an interface between a Multi o The MDSC-PNC Interface (MPI) is an interface between a Multi
Domain Service Coordinator and a Physical Network Controller. It Domain Service Coordinator and a Physical Network Controller. It
communicates the creation request, if required, of new communicates the creation request, if required, of new
connectivity of bandwidth changes in the physical network, via the connectivity of bandwidth changes in the physical network, via the
PNC. In multi-domain environments, the MDSC needs to establish PNC. In multi-domain environments, the MDSC needs to establish
multiple MPIs, one for each PNC, as there are multiple PNCs multiple MPIs, one for each PNC, as there are multiple PNCs
responsible for its domain control. responsible for its domain control.
o The MDSC-MDSC Interface (MMI) is a special case of the MPI and o Incase of hierarchy of MDSC, the MPI is applied recursively. From
behaves similarly to an MPI to support general functions performed an abstraction point of view, the top level MDSC which interfaces
by the MDSCs such as abstraction function and provisioning the CNC operates on a higher level of abstraction (i.e., less
function. From an abstraction point of view, the top level MDSC granular level) than the lower level MSDCs.
which interfaces the CNC operates on a higher level of abstraction
(i.e., less granular level) than the lower level MSDCs. As such,
the MMI carries more abstract TE information than the MPI.
PCEP is especially suitable on the MPI and MMI as it meets the PCEP is especially suitable on the MPI as it meets the requirement
requirement and the functions as set out in the ACTN framework and the functions as set out in the ACTN framework
[I-D.ietf-teas-actn-framework]. Its recursive nature is well suited [I-D.ietf-teas-actn-framework]. Its recursive nature is well suited
via the multi-level hierarchy of PCE. The Section 4 describe how PCE via the multi-level hierarchy of PCE. The Section 4 describe how PCE
and PCEP could help realize ACTN. and PCEP could help realize ACTN.
4. Realizining ACTN with PCE (and PCEP) 4. Realizining ACTN with PCE (and PCEP)
As per the example in the Figure 2, there are 4 domains, each with As per the example in the Figure 2, there are 4 domains, each with
its own PNC and a MDSC at top. The PNC and MDSC need PCE as a its own PNC and a MDSC at top. The PNC and MDSC need PCE as a
important function. The PNC (or child PCE) already uses PCEP to important function. The PNC (or child PCE) already uses PCEP to
communicate to the network device. It can utilize the PCEP as the communicate to the network device. It can utilize the PCEP as the
skipping to change at page 13, line 31 skipping to change at page 13, line 36
7. Security Considerations 7. Security Considerations
The ACTN framework described in [I-D.ietf-teas-actn-framework] The ACTN framework described in [I-D.ietf-teas-actn-framework]
defines key components and interfaces for managed traffic engineered defines key components and interfaces for managed traffic engineered
networks. It also list various security considerations such as networks. It also list various security considerations such as
request and control of resources, confidentially of the information, request and control of resources, confidentially of the information,
and availability of function which should be taken into and availability of function which should be taken into
consideration. consideration.
When PCEP is used on the MPI/MMI, this interface needs to be secured, When PCEP is used on the MPI/MMI, this interface needs to be secured,
use of [I-D.ietf-pce-pceps] is RECOMENDED. Each PCEP extension use of [RFC8253] is RECOMENDED. Each PCEP extension listed in this
listed in this document, presents its individual security document, presents its individual security considerations, which
considerations, which continue to apply. continue to apply.
8. Acknowledgments 8. Acknowledgments
The authors would like to thank Jonathan Hardwick for the inspiration The authors would like to thank Jonathan Hardwick for the inspiration
behind this document. Further thanks to Avantika for her comments behind this document. Further thanks to Avantika for her comments
with suggested text. with suggested text.
9. References 9. References
9.1. Normative References 9.1. Normative References
[RFC5440] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation [RFC5440] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation
Element (PCE) Communication Protocol (PCEP)", RFC 5440, Element (PCE) Communication Protocol (PCEP)", RFC 5440,
DOI 10.17487/RFC5440, March 2009, DOI 10.17487/RFC5440, March 2009,
<http://www.rfc-editor.org/info/rfc5440>. <https://www.rfc-editor.org/info/rfc5440>.
9.2. Informative References 9.2. Informative References
[RFC3630] Katz, D., Kompella, K., and D. Yeung, "Traffic Engineering [RFC3630] Katz, D., Kompella, K., and D. Yeung, "Traffic Engineering
(TE) Extensions to OSPF Version 2", RFC 3630, (TE) Extensions to OSPF Version 2", RFC 3630,
DOI 10.17487/RFC3630, September 2003, DOI 10.17487/RFC3630, September 2003,
<http://www.rfc-editor.org/info/rfc3630>. <https://www.rfc-editor.org/info/rfc3630>.
[RFC4203] Kompella, K., Ed. and Y. Rekhter, Ed., "OSPF Extensions in [RFC4203] Kompella, K., Ed. and Y. Rekhter, Ed., "OSPF Extensions in
Support of Generalized Multi-Protocol Label Switching Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 4203, DOI 10.17487/RFC4203, October 2005, (GMPLS)", RFC 4203, DOI 10.17487/RFC4203, October 2005,
<http://www.rfc-editor.org/info/rfc4203>. <https://www.rfc-editor.org/info/rfc4203>.
[RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation [RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation
Element (PCE)-Based Architecture", RFC 4655, Element (PCE)-Based Architecture", RFC 4655,
DOI 10.17487/RFC4655, August 2006, DOI 10.17487/RFC4655, August 2006,
<http://www.rfc-editor.org/info/rfc4655>. <https://www.rfc-editor.org/info/rfc4655>.
[RFC5152] Vasseur, JP., Ed., Ayyangar, A., Ed., and R. Zhang, "A [RFC5152] Vasseur, JP., Ed., Ayyangar, A., Ed., and R. Zhang, "A
Per-Domain Path Computation Method for Establishing Inter- Per-Domain Path Computation Method for Establishing Inter-
Domain Traffic Engineering (TE) Label Switched Paths Domain Traffic Engineering (TE) Label Switched Paths
(LSPs)", RFC 5152, DOI 10.17487/RFC5152, February 2008, (LSPs)", RFC 5152, DOI 10.17487/RFC5152, February 2008,
<http://www.rfc-editor.org/info/rfc5152>. <https://www.rfc-editor.org/info/rfc5152>.
[RFC5305] Li, T. and H. Smit, "IS-IS Extensions for Traffic [RFC5305] Li, T. and H. Smit, "IS-IS Extensions for Traffic
Engineering", RFC 5305, DOI 10.17487/RFC5305, October Engineering", RFC 5305, DOI 10.17487/RFC5305, October
2008, <http://www.rfc-editor.org/info/rfc5305>. 2008, <https://www.rfc-editor.org/info/rfc5305>.
[RFC5307] Kompella, K., Ed. and Y. Rekhter, Ed., "IS-IS Extensions [RFC5307] Kompella, K., Ed. and Y. Rekhter, Ed., "IS-IS Extensions
in Support of Generalized Multi-Protocol Label Switching in Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 5307, DOI 10.17487/RFC5307, October 2008, (GMPLS)", RFC 5307, DOI 10.17487/RFC5307, October 2008,
<http://www.rfc-editor.org/info/rfc5307>. <https://www.rfc-editor.org/info/rfc5307>.
[RFC5441] Vasseur, JP., Ed., Zhang, R., Bitar, N., and JL. Le Roux, [RFC5441] Vasseur, JP., Ed., Zhang, R., Bitar, N., and JL. Le Roux,
"A Backward-Recursive PCE-Based Computation (BRPC) "A Backward-Recursive PCE-Based Computation (BRPC)
Procedure to Compute Shortest Constrained Inter-Domain Procedure to Compute Shortest Constrained Inter-Domain
Traffic Engineering Label Switched Paths", RFC 5441, Traffic Engineering Label Switched Paths", RFC 5441,
DOI 10.17487/RFC5441, April 2009, DOI 10.17487/RFC5441, April 2009,
<http://www.rfc-editor.org/info/rfc5441>. <https://www.rfc-editor.org/info/rfc5441>.
[RFC5623] Oki, E., Takeda, T., Le Roux, JL., and A. Farrel, [RFC5623] Oki, E., Takeda, T., Le Roux, JL., and A. Farrel,
"Framework for PCE-Based Inter-Layer MPLS and GMPLS "Framework for PCE-Based Inter-Layer MPLS and GMPLS
Traffic Engineering", RFC 5623, DOI 10.17487/RFC5623, Traffic Engineering", RFC 5623, DOI 10.17487/RFC5623,
September 2009, <http://www.rfc-editor.org/info/rfc5623>. September 2009, <https://www.rfc-editor.org/info/rfc5623>.
[RFC6805] King, D., Ed. and A. Farrel, Ed., "The Application of the [RFC6805] King, D., Ed. and A. Farrel, Ed., "The Application of the
Path Computation Element Architecture to the Determination Path Computation Element Architecture to the Determination
of a Sequence of Domains in MPLS and GMPLS", RFC 6805, of a Sequence of Domains in MPLS and GMPLS", RFC 6805,
DOI 10.17487/RFC6805, November 2012, DOI 10.17487/RFC6805, November 2012,
<http://www.rfc-editor.org/info/rfc6805>. <https://www.rfc-editor.org/info/rfc6805>.
[RFC7399] Farrel, A. and D. King, "Unanswered Questions in the Path [RFC7399] Farrel, A. and D. King, "Unanswered Questions in the Path
Computation Element Architecture", RFC 7399, Computation Element Architecture", RFC 7399,
DOI 10.17487/RFC7399, October 2014, DOI 10.17487/RFC7399, October 2014,
<http://www.rfc-editor.org/info/rfc7399>. <https://www.rfc-editor.org/info/rfc7399>.
[RFC7491] King, D. and A. Farrel, "A PCE-Based Architecture for [RFC7491] King, D. and A. Farrel, "A PCE-Based Architecture for
Application-Based Network Operations", RFC 7491, Application-Based Network Operations", RFC 7491,
DOI 10.17487/RFC7491, March 2015, DOI 10.17487/RFC7491, March 2015,
<http://www.rfc-editor.org/info/rfc7491>. <https://www.rfc-editor.org/info/rfc7491>.
[RFC7752] Gredler, H., Ed., Medved, J., Previdi, S., Farrel, A., and [RFC7752] Gredler, H., Ed., Medved, J., Previdi, S., Farrel, A., and
S. Ray, "North-Bound Distribution of Link-State and S. Ray, "North-Bound Distribution of Link-State and
Traffic Engineering (TE) Information Using BGP", RFC 7752, Traffic Engineering (TE) Information Using BGP", RFC 7752,
DOI 10.17487/RFC7752, March 2016, DOI 10.17487/RFC7752, March 2016,
<http://www.rfc-editor.org/info/rfc7752>. <https://www.rfc-editor.org/info/rfc7752>.
[RFC8051] Zhang, X., Ed. and I. Minei, Ed., "Applicability of a [RFC8051] Zhang, X., Ed. and I. Minei, Ed., "Applicability of a
Stateful Path Computation Element (PCE)", RFC 8051, Stateful Path Computation Element (PCE)", RFC 8051,
DOI 10.17487/RFC8051, January 2017, DOI 10.17487/RFC8051, January 2017,
<http://www.rfc-editor.org/info/rfc8051>. <https://www.rfc-editor.org/info/rfc8051>.
[I-D.ietf-pce-stateful-pce] [RFC8231] Crabbe, E., Minei, I., Medved, J., and R. Varga, "Path
Crabbe, E., Minei, I., Medved, J., and R. Varga, "PCEP Computation Element Communication Protocol (PCEP)
Extensions for Stateful PCE", draft-ietf-pce-stateful- Extensions for Stateful PCE", RFC 8231,
pce-21 (work in progress), June 2017. DOI 10.17487/RFC8231, September 2017,
<https://www.rfc-editor.org/info/rfc8231>.
[RFC8253] Lopez, D., Gonzalez de Dios, O., Wu, Q., and D. Dhody,
"PCEPS: Usage of TLS to Provide a Secure Transport for the
Path Computation Element Communication Protocol (PCEP)",
RFC 8253, DOI 10.17487/RFC8253, October 2017,
<https://www.rfc-editor.org/info/rfc8253>.
[I-D.ietf-pce-pce-initiated-lsp] [I-D.ietf-pce-pce-initiated-lsp]
Crabbe, E., Minei, I., Sivabalan, S., and R. Varga, "PCEP Crabbe, E., Minei, I., Sivabalan, S., and R. Varga, "PCEP
Extensions for PCE-initiated LSP Setup in a Stateful PCE Extensions for PCE-initiated LSP Setup in a Stateful PCE
Model", draft-ietf-pce-pce-initiated-lsp-10 (work in Model", draft-ietf-pce-pce-initiated-lsp-11 (work in
progress), June 2017. progress), October 2017.
[I-D.ietf-pce-stateful-hpce] [I-D.ietf-pce-stateful-hpce]
Dhody, D., Lee, Y., Ceccarelli, D., Shin, J., King, D., Dhody, D., Lee, Y., Ceccarelli, D., Shin, J., King, D.,
and O. Dios, "Hierarchical Stateful Path Computation and O. Dios, "Hierarchical Stateful Path Computation
Element (PCE).", draft-ietf-pce-stateful-hpce-00 (work in Element (PCE).", draft-ietf-pce-stateful-hpce-01 (work in
progress), June 2017. progress), June 2017.
[I-D.ietf-teas-pce-central-control] [I-D.ietf-teas-pce-central-control]
Farrel, A., Zhao, Q., Li, Z., and C. Zhou, "An Farrel, A., Zhao, Q., Li, Z., and C. Zhou, "An
Architecture for Use of PCE and PCEP in a Network with Architecture for Use of PCE and PCEP in a Network with
Central Control", draft-ietf-teas-pce-central-control-03 Central Control", draft-ietf-teas-pce-central-control-05
(work in progress), June 2017. (work in progress), September 2017.
[I-D.ietf-teas-actn-requirements] [I-D.ietf-teas-actn-requirements]
Lee, Y., Dhody, D., Belotti, S., Pithewan, K., Ceccarelli, Lee, Y., Dhody, D., Belotti, S., Pithewan, K., Ceccarelli,
D., Miyasaka, T., and J. Shin, "Requirements for D., Miyasaka, T., Shin, J., and K. Lee, "Requirements for
Abstraction and Control of TE Networks", draft-ietf-teas- Abstraction and Control of TE Networks", draft-ietf-teas-
actn-requirements-05 (work in progress), May 2017. actn-requirements-07 (work in progress), October 2017.
[I-D.ietf-teas-actn-framework] [I-D.ietf-teas-actn-framework]
Ceccarelli, D. and Y. Lee, "Framework for Abstraction and Ceccarelli, D. and Y. Lee, "Framework for Abstraction and
Control of Traffic Engineered Networks", draft-ietf-teas- Control of Traffic Engineered Networks", draft-ietf-teas-
actn-framework-06 (work in progress), June 2017. actn-framework-11 (work in progress), October 2017.
[I-D.ietf-teas-actn-info-model] [I-D.ietf-teas-actn-info-model]
Lee, Y., Belotti, S., Dhody, D., Ceccarelli, D., and B. Lee, Y., Belotti, S., Dhody, D., Ceccarelli, D., and B.
Yoon, "Information Model for Abstraction and Control of TE Yoon, "Information Model for Abstraction and Control of TE
Networks (ACTN)", draft-ietf-teas-actn-info-model-01 (work Networks (ACTN)", draft-ietf-teas-actn-info-model-04 (work
in progress), June 2017. in progress), October 2017.
[I-D.ietf-pce-inter-area-as-applicability] [I-D.ietf-pce-inter-area-as-applicability]
King, D., Meuric, J., Dugeon, O., Zhao, Q., Dhody, D., and King, D., Meuric, J., Dugeon, O., Zhao, Q., Dhody, D., and
O. Dios, "Applicability of the Path Computation Element to O. Dios, "Applicability of the Path Computation Element to
Inter-Area and Inter-AS MPLS and GMPLS Traffic Inter-Area and Inter-AS MPLS and GMPLS Traffic
Engineering", draft-ietf-pce-inter-area-as- Engineering", draft-ietf-pce-inter-area-as-
applicability-06 (work in progress), July 2016. applicability-06 (work in progress), July 2016.
[I-D.dhodylee-pce-pcep-ls] [I-D.dhodylee-pce-pcep-ls]
Dhody, D., Lee, Y., and D. Ceccarelli, "PCEP Extension for Dhody, D., Lee, Y., and D. Ceccarelli, "PCEP Extension for
Distribution of Link-State and TE Information.", draft- Distribution of Link-State and TE Information.", draft-
dhodylee-pce-pcep-ls-08 (work in progress), June 2017. dhodylee-pce-pcep-ls-08 (work in progress), June 2017.
[I-D.leedhody-pce-vn-association] [I-D.leedhody-pce-vn-association]
Lee, Y., Dhody, D., Zhang, X., and D. Ceccarelli, "PCEP Lee, Y., Dhody, D., Zhang, X., and D. Ceccarelli, "PCEP
Extensions for Establishing Relationships Between Sets of Extensions for Establishing Relationships Between Sets of
LSPs and Virtual Networks", draft-leedhody-pce-vn- LSPs and Virtual Networks", draft-leedhody-pce-vn-
association-02 (work in progress), March 2017. association-03 (work in progress), September 2017.
[I-D.litkowski-pce-state-sync] [I-D.litkowski-pce-state-sync]
Litkowski, S., Sivabalan, S., and D. Dhody, "Inter Litkowski, S., Sivabalan, S., and D. Dhody, "Inter
Stateful Path Computation Element communication Stateful Path Computation Element communication
procedures", draft-litkowski-pce-state-sync-01 (work in procedures", draft-litkowski-pce-state-sync-02 (work in
progress), February 2017. progress), August 2017.
[I-D.ietf-pce-association-policy] [I-D.ietf-pce-association-policy]
Dhody, D., Sivabalan, S., Litkowski, S., Tantsura, J., and Dhody, D., Sivabalan, S., Litkowski, S., Tantsura, J., and
J. Hardwick, "Path Computation Element communication J. Hardwick, "Path Computation Element communication
Protocol extension for associating Policies and LSPs", Protocol extension for associating Policies and LSPs",
draft-ietf-pce-association-policy-01 (work in progress), draft-ietf-pce-association-policy-01 (work in progress),
June 2017. June 2017.
[I-D.ietf-pce-pceps]
Lopez, D., Dios, O., Wu, Q., and D. Dhody, "Secure
Transport for PCEP", draft-ietf-pce-pceps-14 (work in
progress), May 2017.
[I-D.lee-teas-actn-abstraction] [I-D.lee-teas-actn-abstraction]
Lee, Y., Dhody, D., Ceccarelli, D., and O. Dios, Lee, Y., Dhody, D., Ceccarelli, D., and O. Dios,
"Abstraction and Control of TE Networks (ACTN) Abstraction "Abstraction and Control of TE Networks (ACTN) Abstraction
Methods", draft-lee-teas-actn-abstraction-02 (work in Methods", draft-lee-teas-actn-abstraction-02 (work in
progress), June 2017. progress), June 2017.
[I-D.lee-pce-lsp-stitching-hpce] [I-D.lee-pce-lsp-stitching-hpce]
Lee, Y., Dhody, D., and D. Ceccarelli, "PCEP Extensions Lee, Y., Dhody, D., and D. Ceccarelli, "PCEP Extensions
for Stitching LSPs in Hierarchical Stateful PCE Model", for Stitching LSPs in Hierarchical Stateful PCE Model",
draft-lee-pce-lsp-stitching-hpce-00 (work in progress), draft-lee-pce-lsp-stitching-hpce-00 (work in progress),
 End of changes. 45 change blocks. 
99 lines changed or deleted 106 lines changed or added

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