< draft-chen-teas-frmwk-tts-00.txt		draft-chen-teas-frmwk-tts-01.txt >
	Internet Engineering Task Force H. Chen		Internet Engineering Task Force H. Chen
	Internet-Draft Huawei Technologies		Internet-Draft Huawei Technologies
	Intended status: Standards Track M. Toy		Intended status: Standards Track M. Toy
	Expires: April 18, 2016 Comcast		Expires: September 22, 2016 Comcast
	L. Liu		L. Liu
	Fijitsu		Fujitsu
	October 16, 2015		K. Pithewan
			Infinera
			March 21, 2016
	Framework for Temporal Tunnel Services		Framework for Temporal Tunnel Services
	draft-chen-teas-frmwk-tts-00.txt		draft-chen-teas-frmwk-tts-01.txt
	Abstract		Abstract
	For existing MPLS LSP tunnel services, it is hard for LSP tunnels to		For existing MPLS LSP tunnel services, it is hard for LSP tunnels to
	be booked in advance. In addition, once an LSP tunnel is set up, it		be booked in advance. In addition, once an LSP tunnel is set up, it
	is assumed to consume a certain amount of resources such as link		is assumed to consume a certain amount of resources such as link
	bandwidth forever.		bandwidth forever.
	Temporal LSP tunnel services (TTS) provides an easy way for us to		Temporal LSP tunnel services (TTS) provides an easy way for us to
	book temporal LSP tunnels in advance. More importantly, a temporal		book temporal LSP tunnels in advance. More importantly, a temporal
	skipping to change at page 1, line 45 ¶		skipping to change at page 1, line 47 ¶
	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 April 18, 2016.		This Internet-Draft will expire on September 22, 2016.
	Copyright Notice		Copyright Notice
			Copyright (c) 2016 IETF Trust and the persons identified as the
	Copyright (c) 2015 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
	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 . . . . . . . . . . . . . . . . . . . . . . . . . 3		1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
	2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3		2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 4
	3. Operations Overview . . . . . . . . . . . . . . . . . . . . . 4		3. Operations Overview . . . . . . . . . . . . . . . . . . . . . 5
	3.1. Simple Time Interval . . . . . . . . . . . . . . . . . . . 4		3.1. Simple Time Interval . . . . . . . . . . . . . . . . . . . 5
	3.2. Recurrent Time Interval . . . . . . . . . . . . . . . . . 4		3.2. Recurrent Time Interval . . . . . . . . . . . . . . . . . 5
	3.3. Changes to Time Interval . . . . . . . . . . . . . . . . . 4		3.3. Changes to Time Interval . . . . . . . . . . . . . . . . . 5
	4. Reference Models . . . . . . . . . . . . . . . . . . . . . . . 5		4. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 6
	4.1. Building Blocks . . . . . . . . . . . . . . . . . . . . . 5		5. Reference Models . . . . . . . . . . . . . . . . . . . . . . . 7
	4.1.1. Temporal TED . . . . . . . . . . . . . . . . . . . . . 6		5.1. Building Blocks . . . . . . . . . . . . . . . . . . . . . 7
	4.1.2. Temporal CSPF . . . . . . . . . . . . . . . . . . . . 7		5.1.1. Temporal TED . . . . . . . . . . . . . . . . . . . . . 7
	4.1.3. Temporal Label Database . . . . . . . . . . . . . . . 7		5.1.2. Temporal CSPF . . . . . . . . . . . . . . . . . . . . 8
	4.1.4. Temporal LSP Tunnel Manager . . . . . . . . . . . . . 8		5.1.3. Temporal Label Database . . . . . . . . . . . . . . . 9
	4.1.5. Temporal LSP Database . . . . . . . . . . . . . . . . 8		5.1.4. Temporal LSP Tunnel Manager . . . . . . . . . . . . . 9
	4.1.6. Temporal PCE . . . . . . . . . . . . . . . . . . . . . 9		5.1.5. Temporal LSP Database . . . . . . . . . . . . . . . . 10
	4.2. Centralized Model . . . . . . . . . . . . . . . . . . . . 9		5.1.6. Temporal PCE . . . . . . . . . . . . . . . . . . . . . 10
	4.2.1. Centralized Model for Single Domain . . . . . . . . . 9		5.2. Centralized Model . . . . . . . . . . . . . . . . . . . . 11
	4.2.2. Centralized Model for Multiple Domains . . . . . . . . 12		5.2.1. Centralized Model for Single Domain . . . . . . . . . 11
	4.3. Hybrid Model . . . . . . . . . . . . . . . . . . . . . . . 13		5.2.2. Centralized Model for Multiple Domains . . . . . . . . 14
	4.3.1. Hybrid Model for Single Domain . . . . . . . . . . . . 14		5.2.3. Analysis on Centralized Model . . . . . . . . . . . . 15
	4.3.2. Hybrid Model for Multiple Domains . . . . . . . . . . 16		5.3. Hybrid Model . . . . . . . . . . . . . . . . . . . . . . . 15
	4.3.3. Temporal Stateful PCE . . . . . . . . . . . . . . . . 17		5.3.1. Hybrid Model for Single Domain . . . . . . . . . . . . 15
	4.4. Distributed Model . . . . . . . . . . . . . . . . . . . . 18		5.3.2. Hybrid Model for Multiple Domains . . . . . . . . . . 18
	5. Security Considerations . . . . . . . . . . . . . . . . . . . 20		5.3.3. Temporal Stateful PCE . . . . . . . . . . . . . . . . 19
	6. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 20		5.3.4. Analysis on Hybrid Model . . . . . . . . . . . . . . . 20
	7. References . . . . . . . . . . . . . . . . . . . . . . . . . . 20		5.4. Distributed Model . . . . . . . . . . . . . . . . . . . . 21
	7.1. Normative References . . . . . . . . . . . . . . . . . . . 20		5.4.1. Router Distributed Model . . . . . . . . . . . . . . . 21
	7.2. Informative References . . . . . . . . . . . . . . . . . . 21		5.4.2. Analysis on Distributed Model . . . . . . . . . . . . 22
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 22		6. Security Considerations . . . . . . . . . . . . . . . . . . . 23
			7. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 23
			8. References . . . . . . . . . . . . . . . . . . . . . . . . . . 23
			8.1. Normative References . . . . . . . . . . . . . . . . . . . 23
			8.2. Informative References . . . . . . . . . . . . . . . . . . 24
			Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 25
	1. Introduction		1. Introduction
	Once an existing multiprotocol label switching (MPLS) traffic		Once an existing multiprotocol label switching (MPLS) traffic
	engineering (TE) label switched path (LSP) is set up, it is assumed		engineering (TE) label switched path (LSP) is set up, it is assumed
	to carry traffic forever until it is down. When an MPLS TE LSP		to carry traffic forever until it is down. When an MPLS TE LSP
	tunnel is up, it is assumed to consume the reserved network resources		tunnel is up, it is assumed to consume the reserved network resources
	for it forever even though the LSP may only use the network resources		for it forever even though the LSP may only use the network resources
	during some period of time. As a result, the entire network		during some period of time. As a result, the entire network
	resources are not used efficiently. Moreover, a tunnel service can		resources are not used efficiently. Moreover, a tunnel service can
	skipping to change at page 3, line 36 ¶		skipping to change at page 4, line 36 ¶
	This document specifies a framework for temporal LSP tunnel services		This document specifies a framework for temporal LSP tunnel services
	and provides a few of reference models along with logical components		and provides a few of reference models along with logical components
	required to design a solution for TTS.		required to design a solution for TTS.
	2. Terminology		2. Terminology
	A Time Interval: a time period from time Ta to time Tb.		A Time Interval: a time period from time Ta to time Tb.
	LSP: Label Switched Path. An LSP is a P2P (point-to-point) LSP or a		LSP: Label Switched Path. An LSP is a P2P (point-to-point) LSP or a
	P2MP (point-to-multipoiint) LSP.		P2MP (point-to-multipoint) LSP.
	LSP with a time interval: LSP that carries traffic in the time		LSP with a time interval: LSP that carries traffic in the time
	interval.		interval.
	LSP with a sequence of time intervals: LSP that carries traffic in		LSP with a sequence of time intervals: LSP that carries traffic in
	each of the time intervals.		each of the time intervals.
	Temporal LSP: LSP with a time interval or LSP with a sequence of time		Temporal LSP: LSP with a time interval or LSP with a sequence of time
	intervals.		intervals.
	skipping to change at page 5, line 39 ¶		skipping to change at page 6, line 39 ¶
	When an existing time interval for an LSP is extended, a path		When an existing time interval for an LSP is extended, a path
	satisfying the constraints for the LSP in the extended time interval		satisfying the constraints for the LSP in the extended time interval
	is computed and the LSP along the path is set up to carry traffic in		is computed and the LSP along the path is set up to carry traffic in
	the extended time interval. If the LSP is already up to carry		the extended time interval. If the LSP is already up to carry
	traffic in the existing time interval, the lifetime of the LSP is		traffic in the existing time interval, the lifetime of the LSP is
	extended for time period EA following the existing time interval.		extended for time period EA following the existing time interval.
	When an existing time interval for an LSP is shrunk, the shrunk time		When an existing time interval for an LSP is shrunk, the shrunk time
	periods are removed from the lifetime of the LSP.		periods are removed from the lifetime of the LSP.
	4. Reference Models		4. Problem Statement
	This section presents a few of reference models for TTS after		Assume that a set of temporal LSPs have been set up in a network. In
	introducing some of building blocks.		other words, the network resources have been reserved in advance for
			the LSPs in the set. For every LSP configured with a number of time
			intervals, the network resources have been reserved in advance for
			each of these time intervals. Initially, there is no LSP set up in
			the network.
	4.1. Building Blocks		For the given state of the network, how to handle/satisfy a set of
			service requests containing set up a number of temporal LSPs, delete
			a number of temporal LSPs and update a number of temporal LSPs?
			More specifically, based on the current network state, how to compute
			paths for the temporal LSPs to be set up? how to reserve the network
			resources in advance along the paths computed for the time intervals
			configured for the LSPs? how to release the network resources
			reserved in advance for the LSPs to be deleted and update the network
			state accordingly? how to change the parameters for the LSPs
			configured with time intervals and update the network state
			accordingly?
			The reference models described in the following section can provide
			solutions for this.
			5. Reference Models
			This section presents a few of reference models for providing
			temporal tunnel services (TTS) after introducing some of building
			blocks. For each of the models, its advantages and disadvantages are
			listed.
			5.1. Building Blocks
	This section briefly describes some of the components that may be		This section briefly describes some of the components that may be
	used to build a solution for creating and maintaining temporal LSP		used to build a solution for creating and maintaining temporal LSP
	tunnels.		tunnels.
	4.1.1. Temporal TED		5.1.1. Temporal TED
	The Traffic Engineering (TE) information in a normal TE Database		The Traffic Engineering (TE) information in a normal TE Database
	(TED) represents a unreserved bandwidth Bi at each of eight priority		(TED) represents a unreserved bandwidth Bi at each of eight priority
	levels for a link at one point of time, i.e., at the current time.		levels for a link at one point of time, i.e., at the current time.
	Bandwidth		Bandwidth
	^		^
	|		|
	Bi|______________________________________________________		Bi|______________________________________________________
	|		|
	skipping to change at page 7, line 18 ¶		skipping to change at page 8, line 42 ¶
	If an LSP is completely deleted at time T and uses bandwidth B, then		If an LSP is completely deleted at time T and uses bandwidth B, then
	for every time interval/period (after time T) during which bandwidth		for every time interval/period (after time T) during which bandwidth
	B is reserved for the LSP on a link, B is added to the link for that		B is reserved for the LSP on a link, B is added to the link for that
	time interval/period.		time interval/period.
	If an LSP is to be up at time T and uses bandwidth B, then for every		If an LSP is to be up at time T and uses bandwidth B, then for every
	time interval/period (after time T) during which bandwidth B is		time interval/period (after time T) during which bandwidth B is
	reserved for the LSP on a link, B is subtracted from the link for		reserved for the LSP on a link, B is subtracted from the link for
	that time interval/period.		that time interval/period.
	4.1.2. Temporal CSPF		5.1.2. Temporal CSPF
	An existing constrained shortest path first (CSPF) (or say a normal		An existing constrained shortest path first (CSPF) (or say a normal
	CSPF) computes a path for a normal LSP that satisfies a set of given		CSPF) computes a path for a normal LSP that satisfies a set of given
	constraints using a traffic engineering database (TED).		constraints using a traffic engineering database (TED).
	A temporal CSPF (T-CSPF for short) computes a path for a temporal LSP		A temporal CSPF (T-CSPF for short) computes a path for a temporal LSP
	(i.e., an LSP with a number of time intervals) that satisfies a set		(i.e., an LSP with a number of time intervals) that satisfies a set
	of given constraints in each of the time intervals through using a		of given constraints in each of the time intervals through using a
	temporal TED (T-TED).		temporal TED (T-TED).
	4.1.3. Temporal Label Database		5.1.3. Temporal Label Database
	In a centralized controller, a normal label database (LDB) records		In a centralized controller, a normal label database (LDB) records
	and maintains the status of every label for every node (and/or		and maintains the status of every label for every node (and/or
	interface) in a network, which the controller controls. The status		interface) in a network, which the controller controls. The status
	of a label indicates whether the label is assigned to an LSP.		of a label indicates whether the label is assigned to an LSP.
	A temporal label database (T-LDB) in a centralized controller records		A temporal label database (T-LDB) in a centralized controller records
	and maintains the status of every label in a series of time intervals		and maintains the status of every label in a series of time intervals
	for every node (and/or interface) in a network, on which the		for every node (and/or interface) in a network, on which the
	controller controls. The status of a label in a time interval		controller controls. The status of a label in a time interval
	indicates whether the label is assigned to an LSP in the time		indicates whether the label is assigned to an LSP in the time
	interval.		interval.
	If there are enough labels anytime, we do not need any temporal label		If there are enough labels anytime, we do not need any temporal label
	database and we can just use a normal label database. For example,		database and we can just use a normal label database. For example,
	if we can make sure that at any time the number of LSPs going through		if we can make sure that at any time the number of LSPs going through
	any node in the network is less than the number of labels on the		any node in the network is less than the number of labels on the
	node, then there are enough labels anytime. Thus, we can just use a		node, then there are enough labels anytime. Thus, we can just use a
	normal label database.		normal label database.
	4.1.4. Temporal LSP Tunnel Manager		5.1.4. Temporal LSP Tunnel Manager
	An existing LSP tunnel manager (or say a normal LSP tunnel manager)		An existing LSP tunnel manager (or say a normal LSP tunnel manager)
	receives a request for an operation on an MPLS TE LSP from a user or		receives a request for an operation on an MPLS TE LSP from a user or
	an application. The operation may be a creation of a new MPLS TE LSP		an application. The operation may be a creation of a new MPLS TE LSP
	tunnel, a deletion of an existing MPLS TE LSP tunnel, or a change to		tunnel, a deletion of an existing MPLS TE LSP tunnel, or a change to
	an existing LSP tunnel.		an existing LSP tunnel.
	A temporal LSP tunnel manager (T-LSP Manager for short) receives a		A temporal LSP tunnel manager (T-LSP Manager for short) receives a
	request for an operation on a temporal LSP from a user or an		request for an operation on a temporal LSP from a user or an
	application. The operation may be a creation of a new temporal LSP		application. The operation may be a creation of a new temporal LSP
	skipping to change at page 8, line 44 ¶		skipping to change at page 10, line 19 ¶
	initiates the RSVP signaling to set up the LSP along the path.		initiates the RSVP signaling to set up the LSP along the path.
	The T-LSP manager records the related information for the LSP into		The T-LSP manager records the related information for the LSP into
	the temporal LSP database (T-LSPDB). The information includes the		the temporal LSP database (T-LSPDB). The information includes the
	time intervals for the LSP, the path computed for the LSP, the		time intervals for the LSP, the path computed for the LSP, the
	resources such as bandwidth reserved along the path in each of the		resources such as bandwidth reserved along the path in each of the
	time intervals for the LSP (for centralized controller), the labels		time intervals for the LSP (for centralized controller), the labels
	assigned along the path for the LSP (for centralized controller), and		assigned along the path for the LSP (for centralized controller), and
	the status of the LSP.		the status of the LSP.
	4.1.5. Temporal LSP Database		5.1.5. Temporal LSP Database
	A temporal LSP database (T-LSPDB for short) in a centralized		A temporal LSP database (T-LSPDB for short) in a centralized
	controller stores the related information for every temporal LSP.		controller stores the related information for every temporal LSP.
	For each LSP, the following information will be stored in the		For each LSP, the following information will be stored in the
	T-LSPDB:		T-LSPDB:
	o the time intervals for the LSP,		o the time intervals for the LSP,
	o the paths computed for the LSP,		o the paths computed for the LSP,
	skipping to change at page 9, line 26 ¶		skipping to change at page 10, line 47 ¶
	In a distributed environment, a T-LSPDB on a label edge router (LER)		In a distributed environment, a T-LSPDB on a label edge router (LER)
	stores the following information for every temporal LSP originating		stores the following information for every temporal LSP originating
	from the LER (i.e., the LER is the ingress of the LSP):		from the LER (i.e., the LER is the ingress of the LSP):
	o the time intervals for the LSP,		o the time intervals for the LSP,
	o the paths computed for the LSP, and		o the paths computed for the LSP, and
	o the status of the LSP.		o the status of the LSP.
	4.1.6. Temporal PCE		5.1.6. Temporal PCE
	A temporal PCE (T-PCE for short) is an enhanced version of the		A temporal PCE (T-PCE for short) is an enhanced version of the
	existing PCE. It receives a request for computing a path for a		existing PCE. It receives a request for computing a path for a
	temporal LSP crossing multiple domains, computes the path for the LSP		temporal LSP crossing multiple domains, computes the path for the LSP
	and replies to the request with the path computed. For the LSP with		and replies to the request with the path computed. For the LSP with
	a number of time intervals and some constraints, the path computed		a number of time intervals and some constraints, the path computed
	satisfies the constraints in each of the time intervals.		satisfies the constraints in each of the time intervals.
	4.2. Centralized Model		5.2. Centralized Model
	This section presents two centralized reference models. one model is		This section presents two centralized reference models. one model is
	for a single domain, the other for multiple domains.		for a single domain, the other for multiple domains.
	4.2.1. Centralized Model for Single Domain		5.2.1. Centralized Model for Single Domain
	Figure below illustrates a centralized SDN controller reference model		Figure below illustrates a centralized SDN controller reference model
	for temporal LSP tunnel services for a network (i.e., a single		for temporal LSP tunnel services for a network (i.e., a single
	domain).		domain).
	+--------------------------------------------+		+--------------------------------------------+
	| T-SDN Controller |		| TS-SDN Controller |
	| +---------------+ |		| +---------------+ |
	| /------------| T-LSP Manager | |		| /------------| T-LSP Manager | |
	| / Ia +---------------+ |		| / Ia +---------------+ |
	| +--------+ | | | \ |		| +--------+ | | | \ |
	| | T-CSPF | ________| | | \Id |		| | T-CSPF | ________| | | \Id |
	| +--------+ / Ib /Ic | +---------+ |		| +--------+ / Ib /Ic | +---------+ |
	| \Ie / / | | T-LSPDB | |		| \Ie / / | | T-LSPDB | |
	| +---------+ +-------+ | +---------+ |		| +---------+ +-------+ | +---------+ |
	| | T-TED | | T-LDB | | |		| | T-TED | | T-LDB | | |
	| +---------+ +-------+ | |		| +---------+ +-------+ | |
	skipping to change at page 10, line 33 ¶		skipping to change at page 11, line 46 ¶
	| \( ' |'.---. |		| \( ' |'.---. |
	|---\ Network | '+.		|---\ Network | '+.
	(o \ | | )		(o \ | | )
	( | | o)		( | | o)
	( | | )		( | | )
	( o o .-'		( o o .-'
	' )		' )
	'---._.-. )		'---._.-. )
	'---'		'---'
	The temporal SDN (T-SDN) controller in the reference model controls a		The temporal SDN (TS-SDN) controller in the reference model controls
	network through an API to the network such as PCEP+ (extensions to		a network through an API to the network such as PCEP+ (extensions to
	PCEP for central controller). The T-SDN controller is responsible		PCEP for central controller). The TS-SDN controller is responsible
	for creating and maintaining every temporal LSP in the network.		for creating and maintaining every temporal LSP in the network.
	The T-SDN controller comprises a number of modules, including a T-LSP		The TS-SDN controller comprises a number of modules, including a
	manager, a T-CSPF, a T-TED, a T-LDB and a T-LSPDB. The interfaces		T-LSP manager, a T-CSPF, a T-TED, a T-LDB and a T-LSPDB. The
	among these modules are listed as follows:		interfaces among these modules are listed as follows:
	o Interface Ia between the T-LSP manager and the T-CSPF. Through		o Interface Ia between the T-LSP manager and the T-CSPF. Through
	this interface, the T-LSP manager requests the T-CSPF to compute a		this interface, the T-LSP manager requests the T-CSPF to compute a
	path for a temporal LSP with a number of time intervals and a set		path for a temporal LSP with a number of time intervals and a set
	of constraints, and the T-CSPF responses the T-LSP manager with		of constraints, and the T-CSPF responses the T-LSP manager with
	the path computed that satisfies the constraints in each of the		the path computed that satisfies the constraints in each of the
	time intervals.		time intervals.
	o Interface Ib between the T-LSP manager and the T-TED. When a		o Interface Ib between the T-LSP manager and the T-TED. When a
	temporal LSP with a number of time intervals is to be created,		temporal LSP with a number of time intervals is to be created,
	skipping to change at page 11, line 28 ¶		skipping to change at page 12, line 43 ¶
	o Interface Id between the T-LSP manager and the T-LSPDB. the T-LSP		o Interface Id between the T-LSP manager and the T-LSPDB. the T-LSP
	manager updates the information for every LSP in the T-LSPDB		manager updates the information for every LSP in the T-LSPDB
	through this interface.		through this interface.
	o Interface Ie between the T-CSPF and the T-TED. Through this		o Interface Ie between the T-CSPF and the T-TED. Through this
	interface, the T-CSPF accesses the traffic engineering information		interface, the T-CSPF accesses the traffic engineering information
	such as link bandwidths when it computes a path for a temporal LSP		such as link bandwidths when it computes a path for a temporal LSP
	with a number of time intervals.		with a number of time intervals.
	There is an interface In between the T-SDN controller and the		There is an interface In between the TS-SDN controller and the
	network. In fact, there is a control channel (or interface) between		network. In fact, there is a control channel (or interface) between
	the T-SDN controller and every node in the network.		the TS-SDN controller and every node in the network.
	Initially, the T-TED obtains the original traffic engineering (TE)		Initially, the T-TED obtains the original traffic engineering (TE)
	information such as link bandwidths from the network through the		information such as link bandwidths from the network through the
	interface In (i.e., API to network) for every link in the network.		interface In (i.e., API to network) for every link in the network.
	The T-LDB gets the original label resources from the network through		The T-LDB gets the original label resources from the network through
	the interface In for every node and link in the network.		the interface In for every node and link in the network.
	Then the TE information in the T-TED is updated mostly by the		Then the TE information in the T-TED is updated mostly by the
	following events.		following events.
	skipping to change at page 12, line 32 ¶		skipping to change at page 13, line 47 ¶
	node is removed from the T-LDB if a node specific label space is		node is removed from the T-LDB if a node specific label space is
	used. When a link in the network is down, the label resources on		used. When a link in the network is down, the label resources on
	the link is removed from the T-LDB if a link specific label space		the link is removed from the T-LDB if a link specific label space
	is used.		is used.
	o When a node in the network is up, the label resources on the node		o When a node in the network is up, the label resources on the node
	is added into the T-LDB if a node specific label space is used.		is added into the T-LDB if a node specific label space is used.
	When a link in the network is up, the label resources on the link		When a link in the network is up, the label resources on the link
	is added into the T-LDB if a link specific label space is used.		is added into the T-LDB if a link specific label space is used.
	There are a couple of ways in which the T-SDN controller sets up a		There are a couple of ways in which the TS-SDN controller sets up a
	temporal LSP with a number of time intervals in the network.		temporal LSP with a number of time intervals in the network.
	One way is to set up the LSP in the network along the path computed		One way is to set up the LSP in the network along the path computed
	for the LSP at the start of each time interval and to delete the LSP		for the LSP at the start of each time interval and to delete the LSP
	at the end of each time interval.		at the end of each time interval.
	Another way is to set up the LSP in the network along the path		Another way is to set up the LSP in the network along the path
	computed for the LSP before or at the start of the first time		computed for the LSP before or at the start of the first time
	interval, to update the parameters such as bandwidth for each time		interval, to update the parameters such as bandwidth for each time
	interval, and to delete the LSP at the end of last time interval.		interval, and to delete the LSP at the end of last time interval.
	4.2.2. Centralized Model for Multiple Domains		5.2.2. Centralized Model for Multiple Domains
	The centralized model described in the previous section is for		The centralized model described in the previous section is for
	temporal LSPs within a single domain, which is called single-domain		temporal LSPs within a single domain, which is called single-domain
	centralized model. It can be easily extended to support temporal		centralized model. It can be easily extended to support temporal
	LSPs crossing multiple domains. The extended model is called multi-		LSPs crossing multiple domains. The extended model is called multi-
	domain centralized model. Basically, through replacing the T-CSPF		domain centralized model. Basically, through replacing the T-CSPF
	module with a T-PCE module in the single-domain centralized model, we		module with a T-PCE module in the single-domain centralized model, we
	obtain a multi-domain centralized model.		obtain a multi-domain centralized model.
	Figure below illustrates a centralized SDN controller reference model		Figure below illustrates a centralized SDN controller reference model
	for temporal LSPs crossing multiple domains.		for temporal LSPs crossing multiple domains.
	+--------------------------------------------+		+--------------------------------------------+
	| T-SDN Controller |		| TS-SDN Controller |
	| +---------------+ |		| +---------------+ |
	| /------------| T-LSP Manager | |		| /------------| T-LSP Manager | |
	| / Ia +---------------+ |		| / Ia +---------------+ |
	Im | +--------+ | | | \ |		Im | +--------+ | | | \ |
	----+-+ T-PCE | ________| | | \Id |		----+-+ T-PCE | ________| | | \Id |
	| +--------+ / Ib /Ic | +---------+ |		| +--------+ / Ib /Ic | +---------+ |
	| \Ie / / | | T-LSPDB | |		| \Ie / / | | T-LSPDB | |
	| +---------+ +-------+ | +---------+ |		| +---------+ +-------+ | +---------+ |
	| | T-TED | | T-LDB | | |		| | T-TED | | T-LDB | | |
	| +---------+ +-------+ | |		| +---------+ +-------+ | |
	skipping to change at page 13, line 36 ¶		skipping to change at page 14, line 51 ¶
	| \( ' |'.---. |		| \( ' |'.---. |
	|---\ Network | '+.		|---\ Network | '+.
	(o \ | | )		(o \ | | )
	( | | o)		( | | o)
	( | | )		( | | )
	( o o .-'		( o o .-'
	' )		' )
	'---._.-. )		'---._.-. )
	'---'		'---'
	The T-PCE may be outside of the T-SDN controller. When receiving a		The T-PCE may be outside of the TS-SDN controller. When receiving a
	request for creating a new temporal LSP with a number of time		request for creating a new temporal LSP with a number of time
	intervals and some constraints, the T-SDN controller (or say the		intervals and some constraints, the TS-SDN controller (or say the
	T-LSP manager) asks the T-PCE to compute a path for the LSP.		T-LSP manager) asks the T-PCE to compute a path for the LSP.
	For computing a path for a temporal LSP crossing multiple domains,		For computing a path for a temporal LSP crossing multiple domains,
	the T-PCE communicates with other T-PCEs through interface Im to get		the T-PCE communicates with other T-PCEs through interface Im to get
	an end to end path for the LSP crossing domains. For computing a		an end to end path for the LSP crossing domains. For computing a
	path for a temporal LSP within the network (one domain), the T-PCE		path for a temporal LSP within the network (one domain), the T-PCE
	uses a T-CSPF inside it to obtain a path for the LSP.		uses a T-CSPF inside it to obtain a path for the LSP.
	4.3. Hybrid Model		5.2.3. Analysis on Centralized Model
			In a centralized model, all the network resources are managed and
			maintained by a central controller. Thus it has the following
			advantages:
			o Efficiently use network resources for providing TTS (i.e., finding
			paths for LSPs with time intervals, reserving the network
			resources in these intervals and setting up LSPs in the network).
			o Optimal paths for the LSPs with time intervals.
			A centralized model may have the following disadvantages or issues:
			o Scalability issues since all the work is done in the controller,
			which include computing all the paths for the LSPs with time
			intervals, managing all the network resources, controlling the
			network and so on.
			o Reliability issues since the failure of the controller will lead
			to the failure of the whole system.
			5.3. Hybrid Model
	This section presents a couple of hybrid reference models. one model		This section presents a couple of hybrid reference models. one model
	is for a single domain, the other for multiple domains.		is for a single domain, the other for multiple domains.
	4.3.1. Hybrid Model for Single Domain		5.3.1. Hybrid Model for Single Domain
	Figure below illustrates a hybrid SDN controller reference model for		Figure below illustrates a hybrid SDN controller reference model for
	temporal LSP tunnel services within a single domain.		temporal LSP tunnel services within a single domain.
	+--------------------------------------------+		+--------------------------------------------+
	| T-SDN Controller |		| TS-SDN Controller |
	| +---------------+ |		| +---------------+ |
	| /------------| T-LSP Manager | |		| /------------| T-LSP Manager | |
	| / Ia +---------------+ |		| / Ia +---------------+ |
	| +--------+ | | \ |		| +--------+ | | \ |
	| | T-CSPF | ________| | \Id |		| | T-CSPF | ________| | \Id |
	| +--------+ / Ib | +---------+ |		| +--------+ / Ib | +---------+ |
	| \Ie / | | T-LSPDB | |		| \Ie / | | T-LSPDB | |
	| +---------+ | +---------+ |		| +---------+ | +---------+ |
	| | T-TED | | |		| | T-TED | | |
	| +---------+ | |		| +---------+ | |
	skipping to change at page 14, line 38 ¶		skipping to change at page 16, line 33 ¶
	| ( ' '.---. |		| ( ' '.---. |
	|---' Network '+.		|---' Network '+.
	(o | )		(o | )
	( o)		( o)
	( )		( )
	( o o .-'		( o o .-'
	' )		' )
	'---._.-. )		'---._.-. )
	'---'		'---'
	The temporal SDN (T-SDN) controller in this hybrid reference model		The temporal SDN (TS-SDN) controller in this hybrid reference model
	manages some parts of the resources in the network it controls. For		manages some parts of the resources in the network it controls. For
	example, it may just manage the link bandwidth for every link in the		example, it may just manage the link bandwidth for every link in the
	network. The label resources in the network is not managed by the		network. The label resources in the network is not managed by the
	T-SDN controller. It may still be managed by each node in the		TS-SDN controller. It may still be managed by each node in the
	network.		network.
	The T-SDN controller controls the network through an API to the		The TS-SDN controller controls the network through an API to the
	network such as PCEP. There is a control channel between the T-SDN		network such as PCEP. There is a control channel between the TS-SDN
	controller and each of the LERs in the network. The T-SDN controller		controller and each of the LERs in the network. The TS-SDN
	is responsible for creating and maintaining every temporal LSP in the		controller is responsible for creating and maintaining every temporal
	network through the control channel to the ingress node of the LSP.		LSP in the network through the control channel to the ingress node of
			the LSP.
	The T-SDN controller comprises a T-LSP manager, a T-CSPF, a T-TED and		The TS-SDN controller comprises a T-LSP manager, a T-CSPF, a T-TED
	a T-LSPDB. The interfaces among these modules are listed as follows:		and a T-LSPDB. The interfaces among these modules are listed as
			follows:
	o Interface Ia between the T-LSP manager and the T-CSPF. This		o Interface Ia between the T-LSP manager and the T-CSPF. This
	interface is the same as the one between the T-LSP manager and the		interface is the same as the one between the T-LSP manager and the
	T-CSPF in the centralized model.		T-CSPF in the centralized model.
	o Interface Ib between the T-LSP manager and the T-TED. This		o Interface Ib between the T-LSP manager and the T-TED. This
	interface is the same as the one between the T-LSP manager and the		interface is the same as the one between the T-LSP manager and the
	T-TED in the centralized model.		T-TED in the centralized model.
	o Interface Id between the T-LSP manager and the T-LSPDB. This		o Interface Id between the T-LSP manager and the T-LSPDB. This
	skipping to change at page 15, line 39 ¶		skipping to change at page 17, line 38 ¶
	The TE information in the T-TED in the hybrid model is updated in the		The TE information in the T-TED in the hybrid model is updated in the
	same way as that in the T-TED in the centralized model. But the way		same way as that in the T-TED in the centralized model. But the way
	in which the T-TED in one model obtains the original TE information		in which the T-TED in one model obtains the original TE information
	from the network may be different from the one in another model.		from the network may be different from the one in another model.
	For example, the T-TED in the centralized model may obtain the		For example, the T-TED in the centralized model may obtain the
	original TE information from the network through polling every node		original TE information from the network through polling every node
	in the network. The T-TED in the hybrid model may get the original		in the network. The T-TED in the hybrid model may get the original
	TE information from the network through an OSPF or ISIS adjacency		TE information from the network through an OSPF or ISIS adjacency
	between the T-SDN controller and one of the nodes in the network.		between the TS-SDN controller and one of the nodes in the network.
	There are a couple of ways in which the T-SDN controller sets up a		There are a few of ways in which the TS-SDN controller sets up a
	temporal LSP with a number of time intervals in the network.		temporal LSP with a number of time intervals in the network.
	One way is that the T-SDN controller asks the ingress of the LSP to		One way is that the TS-SDN controller asks the ingress of the LSP to
	signal the LSP in the network along the path computed for the LSP at		signal the LSP in the network along the path computed for the LSP at
	the start of each time interval and to tear down the LSP at the end		the start of each time interval and to tear down the LSP at the end
	of each time interval.		of each time interval.
	Another way is that the T-SDN controller asks the ingress of the LSP		Another way is that the TS-SDN controller asks the ingress of the LSP
	to signal the LSP in the network along the path computed for the LSP		to signal the LSP in the network along the path computed for the LSP
	before or at the start of the first time interval, to update the		before or at the start of the first time interval, to update the
	parameters such as bandwidth for each time interval, and to tear down		parameters such as bandwidth for each time interval, and to tear down
	the LSP at the end of the last time interval.		the LSP at the end of the last time interval.
	4.3.2. Hybrid Model for Multiple Domains		The third way is that the TS-SDN controller asks the ingress of the
			LSP to signal the LSP in the network along the path computed for the
			LSP before or at the start of the first time interval, to reserve
			bandwidth for each time interval, and to tear down the LSP at the end
			of the last time interval.
			5.3.2. Hybrid Model for Multiple Domains
	The hybrid model described in the previous section is for temporal		The hybrid model described in the previous section is for temporal
	LSPs within a single domain, which is called single-domain hybrid		LSPs within a single domain, which is called single-domain hybrid
	model. It can be easily extended to support temporal LSPs crossing		model. It can be easily extended to support temporal LSPs crossing
	multiple domains. The extended model is called multi-domain hybrid		multiple domains. The extended model is called multi-domain hybrid
	model. Basically, through replacing the T-CSPF module with a T-PCE		model. Basically, through replacing the T-CSPF module with a T-PCE
	module in the single-domain hybrid model, we obtain a multi-domain		module in the single-domain hybrid model, we obtain a multi-domain
	hybrid model.		hybrid model.
	Figure below illustrates a hybrid SDN controller reference model for		Figure below illustrates a hybrid SDN controller reference model for
	temporal LSPs crossing multiple domains.		temporal LSPs crossing multiple domains.
	+--------------------------------------------+		+--------------------------------------------+
	| T-SDN Controller |		| TS-SDN Controller |
	| +---------------+ |		| +---------------+ |
	| /------------| T-LSP Manager | |		| /------------| T-LSP Manager | |
	| / Ia +---------------+ |		| / Ia +---------------+ |
	Im | +--------+ | | \ |		Im | +--------+ | | \ |
	----+-+ T-PCE | ________| | \Id |		----+-+ T-PCE | ________| | \Id |
	| +--------+ / Ib | +---------+ |		| +--------+ / Ib | +---------+ |
	| \Ie / | | T-LSPDB | |		| \Ie / | | T-LSPDB | |
	| +---------+ | +---------+ |		| +---------+ | +---------+ |
	| | T-TED | | |		| | T-TED | | |
	| +---------+ | |		| +---------+ | |
	skipping to change at page 16, line 48 ¶		skipping to change at page 19, line 5 ¶
	| ( ' '.---. |		| ( ' '.---. |
	|---' Network '+.		|---' Network '+.
	(o | )		(o | )
	( o)		( o)
	( )		( )
	( o o .-'		( o o .-'
	' )		' )
	'---._.-. )		'---._.-. )
	'---'		'---'
	The T-PCE may be outside of the T-SDN controller. When receiving a		The T-PCE may be outside of the TS-SDN controller. When receiving a
	request for creating a new temporal LSP with a number of time		request for creating a new temporal LSP with a number of time
	intervals and some constraints, the T-SDN controller (or say the		intervals and some constraints, the TS-SDN controller (or say the
	T-LSP manager) asks the T-PCE to compute a path for the LSP.		T-LSP manager) asks the T-PCE to compute a path for the LSP.
	For computing a path for a temporal LSP crossing multiple domains,		For computing a path for a temporal LSP crossing multiple domains,
	the T-PCE communicates with other T-PCEs through interface Im to get		the T-PCE communicates with other T-PCEs through interface Im to get
	an end to end path for the LSP crossing domains. For computing a		an end to end path for the LSP crossing domains. For computing a
	path for a temporal LSP within the network (one domain), the T-PCE		path for a temporal LSP within the network (one domain), the T-PCE
	uses a T-CSPF inside it to obtain a path for the LSP.		uses a T-CSPF inside it to obtain a path for the LSP.
	4.3.3. Temporal Stateful PCE		5.3.3. Temporal Stateful PCE
	From the multi-domain hybrid model described in the previous section,		From the multi-domain hybrid model described in the previous section,
	we can get a temporal stateful PCE (controller) if we uses the		we can get a temporal stateful PCE (controller) if we uses the
	stateful PCEP as the interface between the temporal stateful PCE		stateful PCEP as the interface between the temporal stateful PCE (TS-
	(T-Stateful-PCE for short) controller and the network on which the		Stateful-PCE for short) controller and the network on which the PCE
	PCE controls.		controls.
	Figure below illustrates a temporal stateful PCE controller reference		Figure below illustrates a temporal stateful PCE controller reference
	model.		model.
	+--------------------------------------------+		+--------------------------------------------+
	| T-Stateful-PCE (Controller) |		| TS-Stateful-PCE (Controller) |
	| +---------------+ |		| +---------------+ |
	| /------------| T-LSP Manager | |		| /------------| T-LSP Manager | |
	| / Ia +---------------+ |		| / Ia +---------------+ |
	Im | +--------+ | \ |		Im | +--------+ | \ |
	----+-+ T-PCE | ________| \Id |		----+-+ T-PCE | ________| \Id |
	| +--------+ / Ib +---------+ |		| +--------+ / Ib +---------+ |
	| \Ie / | T-LSPDB | |		| \Ie / | T-LSPDB | |
	| +---------+ +---------+ |		| +---------+ +---------+ |
	| | T-TED | |		| | T-TED | |
	| +---------+ |		| +---------+ |
	skipping to change at page 18, line 5 ¶		skipping to change at page 20, line 6 ¶
	| ( ' '.---. |		| ( ' '.---. |
	|---' Network '+.		|---' Network '+.
	(o | )		(o | )
	( o)		( o)
	( )		( )
	( o o .-'		( o o .-'
	' )		' )
	'---._.-. )		'---._.-. )
	'---'		'---'
	The T-PCE may be outside of the T-Stateful PCE controller. When		The T-PCE may be outside of the TS-Stateful PCE controller. When
	receiving a request for creating a new temporal LSP with a number of		receiving a request for creating a new temporal LSP with a number of
	time intervals and some constraints, the T-Stateful PCE (controller)		time intervals and some constraints, the TS-Stateful PCE (controller)
	asks the T-PCE to compute a path for the LSP.		asks the T-PCE to compute a path for the LSP.
	For computing a path for a temporal LSP crossing multiple domains,		For computing a path for a temporal LSP crossing multiple domains,
	the T-PCE communicates with other T-PCEs through interface Im to get		the T-PCE communicates with other T-PCEs through interface Im to get
	an end to end path for the LSP crossing domains. For computing a		an end to end path for the LSP crossing domains. For computing a
	path for a temporal LSP within the network (one domain), the T-PCE		path for a temporal LSP within the network (one domain), the T-PCE
	uses a T-CSPF inside it to obtain a path for the LSP.		uses a T-CSPF inside it to obtain a path for the LSP.
	After obtaining the path for the LSP, the T-Statefule PCE		After obtaining the path for the LSP, the TS-Statefule PCE
	(controller) reserves in the T-TED the TE resources such as link		(controller) reserves in the T-TED the TE resources such as link
	bandwidths for the LSP along the path in each of the time intervals,		bandwidths for the LSP along the path in each of the time intervals,
	updates in the T-LSPDB the information about the LSP, initiates the		updates in the T-LSPDB the information about the LSP, initiates the
	creation of the LSP at the start of each time interval through		creation of the LSP at the start of each time interval through
	sending a Path Computation LSP Initiate Request (PCInitiate) message		sending a Path Computation LSP Initiate Request (PCInitiate) message
	to the ingress of the LSP, and deletes the LSP at the end of each		to the ingress of the LSP, and deletes the LSP at the end of each
	time interval through sending another PCInitiate message with R		time interval through sending another PCInitiate message with R
	(remove) flag set to 1.		(remove) flag set to 1.
	The T-Statefule PCE (controller) updates the information about the		The TS-Statefule PCE (controller) updates the information about the
	LSP in the T-LSPDB accordingly after receiving a Path Computation LSP		LSP in the T-LSPDB accordingly after receiving a Path Computation LSP
	State Report (PCRpt) message from the ingress of the LSP.		State Report (PCRpt) message from the ingress of the LSP.
	4.4. Distributed Model		5.3.4. Analysis on Hybrid Model
	Figure below illustrates a distributed reference model for temporal		In a hybrid model, some of the network resources are managed and
	LSP tunnel services.		maintained by a central controller. Thus it has the following
			advantages:
			o Efficiently use network resources for providing TTS (i.e., finding
			paths for LSPs with time intervals, reserving the network
			resources in these intervals and setting up LSPs in the network).
			o Optimal paths for the LSPs with time intervals.
			A hybrid model may have the following disadvantages or issues:
			o Reliability issues since the failure of the controller will lead
			to the failure of the whole system.
			5.4. Distributed Model
			5.4.1. Router Distributed Model
			Figure below illustrates a traditional/router distributed reference
			model for temporal LSP tunnel services.
	+----------------------------------------------------+		+----------------------------------------------------+
	| Router |		| Router |
	| +-----------+ +-------------------------------+ |		| +-----------+ +-------------------------------+ |
	| | T-OSPF | | T-MPLS | |		| | T-OSPF | | TS-MPLS | |
	In | |(ISIS) | | Ia +---------------+ | |		In | |(ISIS) | | Ia +---------------+ | |
	---+--+ | | /----+ T-LSP Manager | | |		---+--+ | | /----+ T-LSP Manager | | |
	| | | | / +----+-----+----+ | |		| | | | / +----+-----+----+ | |
	| | | | +----+---+ | | | |		| | | | +----+---+ | | | |
	| +-----+-----+ | | T-CSPF | __|Ir |Id | |		| +-----+-----+ | | T-CSPF | __|Ir |Id | |
	| | | +----+---+ / +---+----+ | |		| | | +----+---+ / +---+----+ | |
	| |Ig | | / |T-LSPDB | | |		| |Ig | | / |T-LSPDB | | |
	| |_ | Ie/ / +--------+ | |		| |_ | Ie/ / +--------+ | |
	| \ | / +----+-----+ | | In		| \ | / +----+-----+ | | In
	| \ | / |T-RSVP-TE +------------+--+----		| \ | / |T-RSVP-TE +------------+--+----
	skipping to change at page 20, line 25 ¶		skipping to change at page 22, line 32 ¶
	After obtaining the path for the LSP from the T-CSPF, the T-LSP		After obtaining the path for the LSP from the T-CSPF, the T-LSP
	manager requests T-RSVP-TE to signal the LSP along the path with the		manager requests T-RSVP-TE to signal the LSP along the path with the
	time intervals.		time intervals.
	The T-LSP manager records the related information for the LSP into		The T-LSP manager records the related information for the LSP into
	the temporal LSP database (T-LSPDB). The information includes the		the temporal LSP database (T-LSPDB). The information includes the
	time intervals for the LSP, the path computed for the LSP, and the		time intervals for the LSP, the path computed for the LSP, and the
	status of the LSP.		status of the LSP.
	5. Security Considerations		5.4.2. Analysis on Distributed Model
			In a distributed model, the network resources are managed and
			maintained by multiple routers. Thus it has the following
			advantages:
			o More reliable. When one router fails, the system continues
			working.
			o More scalable for path computations since the path computation
			load is distributed among the multiple routers.
			A distributed model may have the following disadvantages or issues:
			o Sub-optimal paths for the LSPs with time intervals since a
			controller or router may not have the latest accurate information
			about the network resources.
			o Network resources may not be used efficiently.
			o Scalability issues for the distribution of link bandwidth with
			time intervals by IGP in the network, which may consume lots of
			network resources such as memory and link bandwidth.
			6. Security Considerations
	The mechanism described in this document does not raise any new		The mechanism described in this document does not raise any new
	security issues.		security issues.
	6. Acknowledgement		7. Acknowledgement
	The authors would like to thank every one who gives his valuable		The authors would like to thank every one who gives his valuable
	comments on this draft.		comments on this draft.
	7. References		8. References
	7.1. Normative References		8.1. Normative References
	[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate		[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
	Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/		Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/
	RFC2119, March 1997,		RFC2119, March 1997,
	<http://www.rfc-editor.org/info/rfc2119>.		<http://www.rfc-editor.org/info/rfc2119>.
	[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,
	<http://www.rfc-editor.org/info/rfc3209>.		<http://www.rfc-editor.org/info/rfc3209>.
	skipping to change at page 21, line 40 ¶		skipping to change at page 24, line 24 ¶
	Extensions for Stateful PCE",		Extensions for Stateful PCE",
	draft-ietf-pce-stateful-pce-11 (work in progress) ,		draft-ietf-pce-stateful-pce-11 (work in progress) ,
	April 2015.		April 2015.
	[I-D.ietf-pce-pce-initiated-lsp]		[I-D.ietf-pce-pce-initiated-lsp]
	Crabbe, E., Minei, I., Medved, J., and R. Varga, "PCEP		Crabbe, E., Minei, I., Medved, J., 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-04 (work in		Model", draft-ietf-pce-pce-initiated-lsp-04 (work in
	progress) , April 2015.		progress) , April 2015.
	7.2. Informative References		8.2. Informative References
	[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, DOI 10.17487/		Element (PCE)-Based Architecture", RFC 4655, DOI 10.17487/
	RFC4655, August 2006,		RFC4655, August 2006,
	<http://www.rfc-editor.org/info/rfc4655>.		<http://www.rfc-editor.org/info/rfc4655>.
	[RFC5862] Yasukawa, S. and A. Farrel, "Path Computation Clients		[RFC5862] Yasukawa, S. and A. Farrel, "Path Computation Clients
	(PCC) - Path Computation Element (PCE) Requirements for		(PCC) - Path Computation Element (PCE) Requirements for
	Point-to-Multipoint MPLS-TE", RFC 5862, DOI 10.17487/		Point-to-Multipoint MPLS-TE", RFC 5862, DOI 10.17487/
	RFC5862, June 2010,		RFC5862, June 2010,
	skipping to change at page 22, line 37 ¶		skipping to change at page 25, line 23 ¶
	Mehmet Toy		Mehmet Toy
	Comcast		Comcast
	1800 Bishops Gate Blvd.		1800 Bishops Gate Blvd.
	Mount Laurel, NJ 08054		Mount Laurel, NJ 08054
	USA		USA
	Email: mehmet_toy@cable.comcast.com		Email: mehmet_toy@cable.comcast.com
	Lei Liu		Lei Liu
	Fijitsu		Fujitsu
	USA		USA
	Email: lliu@us.fujitsu.com		Email: lliu@us.fujitsu.com
			Khuzema Pithewan
			Infinera
			Email: kpithewan@infinera.com
End of changes. 60 change blocks.
	101 lines changed or deleted		207 lines changed or added
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/