draft-ietf-teas-scheduled-resources-02.txt   draft-ietf-teas-scheduled-resources-03.txt 
TEAS Working Group Y. Zhuang TEAS Working Group Y. Zhuang
Internet-Draft Q. Wu Internet-Draft Q. Wu
Intended status: Standards Track H. Chen Intended status: Standards Track H. Chen
Expires: July 7, 2017 Huawei Expires: December 28, 2017 Huawei
A. Farrel A. Farrel
Juniper Networks Juniper Networks
January 3, 2017 June 26, 2017
Architecture for Scheduled Use of Resources Architecture for Scheduled Use of Resources
draft-ietf-teas-scheduled-resources-02 draft-ietf-teas-scheduled-resources-03
Abstract Abstract
Time-scheduled reservation of traffic engineering (TE) resources can Time-scheduled reservation of traffic engineering (TE) resources can
be used to provide resource booking for TE Label Switched Paths so as be used to provide resource booking for TE Label Switched Paths so as
to better guarantee services for customers and to improve the to better guarantee services for customers and to improve the
efficiency of network resource usage into the future. This document efficiency of network resource usage into the future. This document
provides a framework that describes and discusses the architecture provides a framework that describes and discusses the architecture
for the scheduled reservation of TE resources. This document does for the scheduled reservation of TE resources. This document does
not describe specific protocols or protocol extensions needed to not describe specific protocols or protocol extensions needed to
skipping to change at page 1, line 40 skipping to change at page 1, line 40
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 http://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 July 7, 2017. This Internet-Draft will expire on December 28, 2017.
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 (http://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
skipping to change at page 2, line 50 skipping to change at page 2, line 50
traffic they carry, thus providing some guarantees of service traffic they carry, thus providing some guarantees of service
delivery and allowing a network operator to plan the use of the delivery and allowing a network operator to plan the use of the
resources across the whole network. resources across the whole network.
In some technologies (such as wavelength switched optical networks) In some technologies (such as wavelength switched optical networks)
the resource is synonymous with the label that is switched on the the resource is synonymous with the label that is switched on the
path of the LSP so that it is not possible to establish an LSP that path of the LSP so that it is not possible to establish an LSP that
can carry traffic without assigning a concrete resource to the LSP. can carry traffic without assigning a concrete resource to the LSP.
In other technologies (such as packet switched networks) the In other technologies (such as packet switched networks) the
resources assigned to an LSP are a measure of the capacity of a link resources assigned to an LSP are a measure of the capacity of a link
that is dedicated for use by the traffic on the LSP. In all cases, that is dedicated for use by the traffic on the LSP.
network planning consists of selecting paths for LSPs through the
network so that there will be no contention for resources; LSP In all cases, network planning consists of selecting paths for LSPs
establishment is the act of setting up an LSP and reserving resources through the network so that there will be no contention for
within the network; and network optimization or re-optimization is resources. LSP establishment is the act of setting up an LSP and
the process of re-positioning LSPs in the network to make the reserving resources within the network. Network optimization or re-
unreserved network resources more useful for potential future LSPs optimization is the process of re-positioning LSPs in the network to
while ensuring that the established LSPs continue to fulfill their make the unreserved network resources more useful for potential
objectives. future LSPs while ensuring that the established LSPs continue to
fulfill their objectives.
It is often the case that it is known that an LSP will be needed at It is often the case that it is known that an LSP will be needed at
some time in the future. While a path for that LSP could be computed some time in the future. While a path for that LSP could be computed
using knowledge of the currently established LSPs and the currently using knowledge of the currently established LSPs and the currently
available resources, this does not give any degree of certainty that available resources, this does not give any degree of certainty that
the necessary resources will be available when it is time to set up the necessary resources will be available when it is time to set up
the new LSP. Yet setting up the LSP ahead of the time when it is the new LSP. Yet setting up the LSP ahead of the time when it is
needed (which would guarantee the availability of the resources) is needed (which would guarantee the availability of the resources) is
wasteful since the network resources could be used for some other wasteful since the network resources could be used for some other
purpose in the meantime. purpose in the meantime.
skipping to change at page 14, line 8 skipping to change at page 14, line 8
reserves the resources, and also asks PCE2 to compute and reserve in reserves the resources, and also asks PCE2 to compute and reserve in
Domain 2 (b). PCE2 may return a full path, or could return a path Domain 2 (b). PCE2 may return a full path, or could return a path
key [RFC5520]. When it is time for LSP setup PCE1 triggers the head- key [RFC5520]. When it is time for LSP setup PCE1 triggers the head-
end LSR (c) and the LSP is signaled (d). If a path key is used, the end LSR (c) and the LSP is signaled (d). If a path key is used, the
entry LSR in Domain 2 will consult PCE2 for the path expansion (e) entry LSR in Domain 2 will consult PCE2 for the path expansion (e)
before completing signaling (f). before completing signaling (f).
------------------- -------------------
| Service Requester | | Service Requester |
------------------- -------------------
^ ^
a| a|
v v
------ b ------ ------ b ------
| |<---------------->| | | |<---------------->| |
| PCE1 | | PCE2 | | PCE1 | | PCE2 |
| | | | | | | |
------ ------ ------ ------
^ ^ ^ ^
| | | |
c| e| c| e|
| | | |
----+----------------- ----+----------------- ----+----------------- ----+-----------------
| | Domain 1 | | | Domain 2 | | | Domain 1 | | | Domain 2 |
| v | | v | | v | | v |
| ----- d ----- | | ----- f ----- | | ----- d ----- | | ----- f ----- |
| | LSR |<--->| LSR |<-+--+->| LSR |<--->| LSR | | | | LSR |<--->| LSR |<-+--+->| LSR |<--->| LSR | |
| ----- ----- | | ----- ----- | | ----- ----- | | ----- ----- |
skipping to change at page 15, line 8 skipping to change at page 15, line 8
Finally we should consider hierarchical PCE (H-PCE) [RFC6805]. This Finally we should consider hierarchical PCE (H-PCE) [RFC6805]. This
mode of operatation is similar to that shown in Figure 3, but a mode of operatation is similar to that shown in Figure 3, but a
parent PCE is used to coordinate the requests to the child PCEs parent PCE is used to coordinate the requests to the child PCEs
resulting in better visibility of the end-to-end path and better resulting in better visibility of the end-to-end path and better
coordination of the resource booking. The sequenced flow of control coordination of the resource booking. The sequenced flow of control
is shown in Figure 4. is shown in Figure 4.
------------------- -------------------
| Service Requester | | Service Requester |
------------------- -------------------
^ ^
a| a|
v v
-------- --------
| | | |
| Parent | | Parent |
| PCE | | PCE |
| | | |
-------- --------
^ ^ b ^ ^ b
b| |_______________________ b| |_______________________
| | | |
v v v v
------ ------ ------ ------
| | | | | | | |
| PCE1 | | PCE2 | | PCE1 | | PCE2 |
| | | | | | | |
------ ------ ------ ------
^ ^ ^ ^
| | | |
c| e| c| e|
| | | |
----+----------------- ----+----------------- ----+----------------- ----+-----------------
| | Domain 1 | | | Domain 2 | | | Domain 1 | | | Domain 2 |
| v | | v | | v | | v |
| ----- d ----- | | ----- f ----- | | ----- d ----- | | ----- f ----- |
| | LSR |<--->| LSR |<-+--+->| LSR |<--->| LSR | | | | LSR |<--->| LSR |<-+--+->| LSR |<--->| LSR | |
| ----- ----- | | ----- ----- | | ----- ----- | | ----- ----- |
skipping to change at page 17, line 6 skipping to change at page 17, line 6
[DRAGON] National Science Foundation, "http://www.maxgigapop.net/ [DRAGON] National Science Foundation, "http://www.maxgigapop.net/
wp-content/uploads/The-DRAGON-Project.pdf". wp-content/uploads/The-DRAGON-Project.pdf".
[I-D.chen-teas-frmwk-tts] [I-D.chen-teas-frmwk-tts]
Chen, H., Toy, M., Liu, L., and K. Pithewan, "Framework Chen, H., Toy, M., Liu, L., and K. Pithewan, "Framework
for Temporal Tunnel Services", draft-chen-teas-frmwk- for Temporal Tunnel Services", draft-chen-teas-frmwk-
tts-01 (work in progress), March 2016. tts-01 (work in progress), March 2016.
[I-D.ietf-pce-pceps] [I-D.ietf-pce-pceps]
Lopez, D., Dios, O., Wu, W., and D. Dhody, "Secure Lopez, D., Dios, O., Wu, Q., and D. Dhody, "Secure
Transport for PCEP", draft-ietf-pce-pceps-11 (work in Transport for PCEP", draft-ietf-pce-pceps-14 (work in
progress), January 2017. progress), May 2017.
[I-D.ietf-pce-stateful-pce] [I-D.ietf-pce-stateful-pce]
Crabbe, E., Minei, I., Medved, J., and R. Varga, "PCEP Crabbe, E., Minei, I., Medved, J., and R. Varga, "PCEP
Extensions for Stateful PCE", draft-ietf-pce-stateful- Extensions for Stateful PCE", draft-ietf-pce-stateful-
pce-18 (work in progress), December 2016. pce-21 (work in progress), June 2017.
[I-D.yong-ccamp-ason-gmpls-autobw-service] [I-D.yong-ccamp-ason-gmpls-autobw-service]
Yong, L. and Y. Lee, "ASON/GMPLS Extension for Reservation Yong, L. and Y. Lee, "ASON/GMPLS Extension for Reservation
and Time Based Automatic Bandwidth Service", draft-yong- and Time Based Automatic Bandwidth Service", draft-yong-
ccamp-ason-gmpls-autobw-service-00 (work in progress), ccamp-ason-gmpls-autobw-service-00 (work in progress),
October 2006. October 2006.
[RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., [RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V.,
and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP
Tunnels", RFC 3209, DOI 10.17487/RFC3209, December 2001, Tunnels", RFC 3209, DOI 10.17487/RFC3209, December 2001,
 End of changes. 9 change blocks. 
43 lines changed or deleted 44 lines changed or added

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