draft-ietf-teas-native-ip-scenarios-04.txt		draft-ietf-teas-native-ip-scenarios-05.txt
	TEAS Working Group A. Wang		TEAS Working Group A. Wang
	Internet-Draft China Telecom		Internet-Draft China Telecom
	Intended status: Informational X. Huang		Intended status: Informational X. Huang
	Expires: December 5, 2019 C. Kou		Expires: December 14, 2019 C. Kou
	BUPT		BUPT
	Z. Li		Z. Li
	China Mobile		China Mobile
	P. Mi		P. Mi
	Huawei Technologies		Huawei Technologies
	June 3, 2019		June 12, 2019
	Scenario, Simulation and Suggestion of PCE in Native IP Network		Scenarios and Simulation Results of PCE in Native IP Network
	draft-ietf-teas-native-ip-scenarios-04		draft-ietf-teas-native-ip-scenarios-05
	Abstract		Abstract
	This document describes the scenarios, simulation and suggestions for		This document describes the scenarios, simulation and suggestions for
	PCE in native IP network, which integrates the merit of distributed		PCE in native IP network, which integrates the merit of distributed
	protocols (IGP/BGP), and the power of centrally control technologies		protocols (IGP/BGP), and the power of centrally control technologies
	(PCE/SDN) to provide one feasible traffic engineering solution in		(PCE/SDN) to provide one feasible traffic engineering solution in
	various complex scenarios for the service provider.		various complex scenarios for the service provider.
	Status of This Memo		Status of This Memo
	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 https://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 5, 2019.		This Internet-Draft will expire on December 14, 2019.
	Copyright Notice		Copyright Notice
	Copyright (c) 2019 IETF Trust and the persons identified as the		Copyright (c) 2019 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
	(https://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
	2. Conventions used in this document . . . . . . . . . . . . . . 3		2. CCDR Scenarios. . . . . . . . . . . . . . . . . . . . . . . . 3
	3. CCDR Scenarios. . . . . . . . . . . . . . . . . . . . . . . . 3		2.1. QoS Assurance for Hybrid Cloud-based Application. . . . . 3
	3.1. QoS Assurance for Hybrid Cloud-based Application. . . . . 3		2.2. Link Utilization Maximization . . . . . . . . . . . . . . 4
	3.2. Link Utilization Maximization . . . . . . . . . . . . . . 4		2.3. Traffic Engineering for Multi-Domain . . . . . . . . . . 5
	3.3. Traffic Engineering for Multi-Domain . . . . . . . . . . 5		2.4. Network Temporal Congestion Elimination. . . . . . . . . 6
	3.4. Network Temporal Congestion Elimination. . . . . . . . . 6		3. CCDR Simulation. . . . . . . . . . . . . . . . . . . . . . . 6
	4. CCDR Simulation. . . . . . . . . . . . . . . . . . . . . . . 6		3.1. Topology Simulation . . . . . . . . . . . . . . . . . . . 6
	4.1. Topology Simulation . . . . . . . . . . . . . . . . . . . 6		3.2. Traffic Matrix Simulation. . . . . . . . . . . . . . . . 7
	4.2. Traffic Matrix Simulation. . . . . . . . . . . . . . . . 7		3.3. CCDR End-to-End Path Optimization . . . . . . . . . . . . 7
	4.3. CCDR End-to-End Path Optimization . . . . . . . . . . . . 7		3.4. Network Temporal Congestion Elimination . . . . . . . . . 9
	4.4. Network Temporal Congestion Elimination . . . . . . . . . 9		4. CCDR Deployment Consideration. . . . . . . . . . . . . . . . 10
	5. CCDR Deployment Consideration. . . . . . . . . . . . . . . . 10		5. Security Considerations . . . . . . . . . . . . . . . . . . . 11
	6. Security Considerations . . . . . . . . . . . . . . . . . . . 11		6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11
	7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11		7. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 11
	8. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 11		8. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 11
	9. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 11		9. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
	10. Normative References . . . . . . . . . . . . . . . . . . . . 11		9.1. Normative References . . . . . . . . . . . . . . . . . . 11
			9.2. Informative References . . . . . . . . . . . . . . . . . 12
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12		Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12
	1. Introduction		1. Introduction
	Service provider network is composed thousands of routers that run		Service provider network is composed thousands of routers that run
	distributed protocol to exchange the reachability information between		distributed protocol to exchange the reachability information between
	them. The path for the destination network is mainly calculated and		them. The path for the destination network is mainly calculated and
	controlled by the IGP/BGP protocols. These distributed protocols are		controlled by the IGP/BGP protocols. These distributed protocols are
	robust enough to support the current evolution of Internet but have		robust enough to support the current evolution of Internet but have
	some difficulties when application requires the end-to-end QoS		some difficulties when application requires the end-to-end QoS
	skipping to change at page 3, line 13 ¶		skipping to change at page 3, line 14 ¶
	router to do label push and pop action in-depth, and need complex		router to do label push and pop action in-depth, and need complex
	mechanic for coexisting with the Non-SR network. Additionally, it		mechanic for coexisting with the Non-SR network. Additionally, it
	can only maneuver the end-to-end path for MPLS and IPv6 traffic via		can only maneuver the end-to-end path for MPLS and IPv6 traffic via
	different mechanisms.		different mechanisms.
	DetNet[RFC8578] describes use cases for diverse industries that have		DetNet[RFC8578] describes use cases for diverse industries that have
	in common a need for "deterministic flows", which can provide		in common a need for "deterministic flows", which can provide
	guaranteed bandwidth, bounded latency, and other properties germane		guaranteed bandwidth, bounded latency, and other properties germane
	to the transport of time-sensitive data. The use cases focus mainly		to the transport of time-sensitive data. The use cases focus mainly
	on the industrial critical applications within one centrally		on the industrial critical applications within one centrally
	controlled corporate network and are out of scope of this draft. And		controlled network and are out of scope of this draft.
	as described in [I-D.ietf-detnet-dp-sol-ip], the solution for the
	DetNet use cases requires the update of the network data plane, which
	is not easy being deployed within the service provider network and is
	out of scope that described in [I-D.ietf-teas-pce-native-ip]
	This draft describes scenarios that the centrally control dynamic		This draft describes scenarios that the centrally control dynamic
	routing (CCDR) framework can easily solve, without adding more extra		routing (CCDR) framework can easily solve, without the change of the
	burden on the router. It also gives the path optimization simulation		data plane behaviour on the router. It also gives the path
	results to illustrate the applicability of CCDR framework. Finally,		optimization simulation results to illustrate the applicability of
	it gives some suggestions for the implementation and deployment of		CCDR framework.
	CCDR.
	2. Conventions used in this document
	The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
	"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
	document are to be interpreted as described in RFC 2119 [RFC2119].
	3. CCDR Scenarios.		2. CCDR Scenarios.
	The following sections describe some scenarios that the CCDR		The following sections describe some scenarios that the CCDR
	framework is suitable for deployment.		framework is suitable for deployment.
	3.1. QoS Assurance for Hybrid Cloud-based Application.		2.1. QoS Assurance for Hybrid Cloud-based Application.
	With the emerge of cloud computing technologies, enterprises are		With the emerge of cloud computing technologies, enterprises are
	putting more and more services on the public oriented cloud		putting more and more services on the public oriented cloud
	environment, but keep core business within their private cloud. The		environment, but keep core business within their private cloud. The
	communication between the private and public cloud will span the WAN		communication between the private and public cloud will span the WAN
	network. The bandwidth requirements between them are variable and		network. The bandwidth requirements between them are variable and
	the background traffic between these two sites changes from time to		the background traffic between these two sites changes from time to
	time. Enterprise applications just want to exploit the network		time. Enterprise applications just want to exploit the network
	capabilities to assure the end-to-end QoS performance on demand.		capabilities to assure the end-to-end QoS performance on demand.
	skipping to change at page 4, line 32 ¶		skipping to change at page 4, line 32 ¶
	By default, the traffic path between the private and public cloud		By default, the traffic path between the private and public cloud
	site will be determined by the distributed control network. When		site will be determined by the distributed control network. When
	applications require the end-to-end QoS assurance, it can send these		applications require the end-to-end QoS assurance, it can send these
	requirements to PCE,let PCE compute one e2e path which is based on		requirements to PCE,let PCE compute one e2e path which is based on
	the underlying network topology and the real traffic information, to		the underlying network topology and the real traffic information, to
	accommodate the application's QoS requirements. The proposed		accommodate the application's QoS requirements. The proposed
	solution can refer the draft [I-D.ietf-teas-pce-native-ip].		solution can refer the draft [I-D.ietf-teas-pce-native-ip].
	Section 4 describes the detail simulation process and the result.		Section 4 describes the detail simulation process and the result.
	3.2. Link Utilization Maximization		2.2. Link Utilization Maximization
	Network topology within MAN is generally in star mode as illustrated		Network topology within MAN is generally in star mode as illustrated
	in Fig.2, with different devices connect different customer types.		in Fig.2, with different devices connect different customer types.
	The traffic from these customers is often in tidal pattern that the		The traffic from these customers is often in tidal pattern that the
	links between the CR/BRAS and CR/SR will experience congestion in		links between the CR/BRAS and CR/SR will experience congestion in
	different periods, because the subscribers under BRAS often use the		different periods, because the subscribers under BRAS often use the
	network at night and the dedicated line users under SR often use the		network at night and the dedicated line users under SR often use the
	network during the daytime. The uplink between BRAS/SR and CR must		network during the daytime. The uplink between BRAS/SR and CR must
	satisfy the maximum traffic volume between them respectively and this		satisfy the maximum traffic volume between them respectively and this
	causes these links often in underutilization situation.		causes these links often in underutilization situation.
	skipping to change at page 5, line 37 ¶		skipping to change at page 5, line 37 ¶
	+----|---+		+----|---+
	|		|
	--------|--------|-------|		--------|--------|-------|
	| | | |		| | | |
	+--|-+ +-|- +--|-+ +-|+		+--|-+ +-|- +--|-+ +-|+
	|BRAS-----SR| |BRAS-----SR|		|BRAS-----SR| |BRAS-----SR|
	+----+ +--+ +----+ +--+		+----+ +--+ +----+ +--+
	Fig.3 Link Utilization Maximization via CCDR		Fig.3 Link Utilization Maximization via CCDR
	3.3. Traffic Engineering for Multi-Domain		2.3. Traffic Engineering for Multi-Domain
	Operator's networks are often comprised by different domains,		Operator's networks are often comprised by different domains,
	interconnected with each other,form very complex topology that		interconnected with each other,form very complex topology that
	illustrated in Fig.4. Due to the traffic pattern to/from MAN and		illustrated in Fig.4. Due to the traffic pattern to/from MAN and
	IDC, the utilization of links between them are often asymmetric. It		IDC, the utilization of links between them are often asymmetric. It
	is almost impossible to balance the utilization of these links via		is almost impossible to balance the utilization of these links via
	the distributed protocol, but this unbalance phenomenon can be		the distributed protocol, but this unbalance phenomenon can be
	overcome via the CCDR framework.		overcome via the CCDR framework.
	+---+ +---+		+---+ +---+
	skipping to change at page 6, line 25 ¶		skipping to change at page 6, line 25 ¶
	Fig.4 Traffic Engineering for Complex Multi-Domain Topology		Fig.4 Traffic Engineering for Complex Multi-Domain Topology
	Solution for this scenario requires the gather of NetFlow		Solution for this scenario requires the gather of NetFlow
	information, analysis the source/destination AS of them and determine		information, analysis the source/destination AS of them and determine
	which pair is the main cause of the congested link. After this, the		which pair is the main cause of the congested link. After this, the
	operator can use the multi eBGP sessions described in		operator can use the multi eBGP sessions described in
	[I-D.ietf-teas-pce-native-ip]to schedule the traffic among different		[I-D.ietf-teas-pce-native-ip]to schedule the traffic among different
	domains.		domains.
	3.4. Network Temporal Congestion Elimination.		2.4. Network Temporal Congestion Elimination.
	In more general situation, there are often temporal congestions		In more general situation, there are often temporal congestions
	within the service provider's network. Such congestion phenomena		within the service provider's network. Such congestion phenomena
	often appear repeatedly and if the service provider has some methods		often appear repeatedly and if the service provider has some methods
	to mitigate it, it will certainly increase the degree of satisfaction		to mitigate it, it will certainly increase the degree of satisfaction
	for their customers. CCDR is also suitable for such scenario in such		for their customers. CCDR is also suitable for such scenario in such
	manner that the distributed protocol process most of the traffic		manner that the distributed protocol process most of the traffic
	forwarding and the controller schedule some traffic out of the		forwarding and the controller schedule some traffic out of the
	congestion links to lower the utilization of them. Section 4		congestion links to lower the utilization of them. Section 4
	describes the simulation process and results about such scenario.		describes the simulation process and results about such scenario.
	4. CCDR Simulation.		3. CCDR Simulation.
	The following sections describe the topology, traffic matrix, end-to-		The following sections describe the topology, traffic matrix, end-to-
	end path optimization and congestion elimination in CCDR applied		end path optimization and congestion elimination in CCDR applied
	scenarios.		scenarios.
	4.1. Topology Simulation		3.1. Topology Simulation
	The network topology mainly contains nodes and links information.		The network topology mainly contains nodes and links information.
	Nodes used in simulation have two types: core node and edge node.		Nodes used in simulation have two types: core node and edge node.
	The core nodes are fully linked to each other. The edge nodes are		The core nodes are fully linked to each other. The edge nodes are
	connected only with some of the core nodes. Fig.5 is a topology		connected only with some of the core nodes. Fig.5 is a topology
	example of 4 core nodes and 5 edge nodes. In CCDR simulation, 100		example of 4 core nodes and 5 edge nodes. In CCDR simulation, 100
	core nodes and 400 edge nodes are generated.		core nodes and 400 edge nodes are generated.
	+----+		+----+
	/|Edge|\		/|Edge|\
	skipping to change at page 7, line 32 ¶		skipping to change at page 7, line 32 ¶
	| +------\ +----+		| +------\ +----+
	| ---|Edge|		| ---|Edge|
	+-----------------/ +----+		+-----------------/ +----+
	Fig.5 Topology of Simulation		Fig.5 Topology of Simulation
	The number of links connecting one edge node to the set of core nodes		The number of links connecting one edge node to the set of core nodes
	is randomly between 2 to 30, and the total number of links is more		is randomly between 2 to 30, and the total number of links is more
	than 20000. Each link has its congestion threshold.		than 20000. Each link has its congestion threshold.
	4.2. Traffic Matrix Simulation.		3.2. Traffic Matrix Simulation.
	The traffic matrix is generated based on the link capacity of		The traffic matrix is generated based on the link capacity of
	topology. It can result in many kinds of situations, such as		topology. It can result in many kinds of situations, such as
	congestion, mild congestion and non-congestion.		congestion, mild congestion and non-congestion.
	In CCDR simulation, the dimension of the traffic matrix is 500*500.		In CCDR simulation, the dimension of the traffic matrix is 500*500.
	About 20% links are overloaded when the Open Shortest Path First		About 20% links are overloaded when the Open Shortest Path First
	(OSPF) protocol is used in the network.		(OSPF) protocol is used in the network.
	4.3. CCDR End-to-End Path Optimization		3.3. CCDR End-to-End Path Optimization
	The CCDR end-to-end path optimization is to find the best path which		The CCDR end-to-end path optimization is to find the best path which
	is the lowest in metric value and each link of the path is far below		is the lowest in metric value and each link of the path is far below
	link's threshold. Based on the current state of the network, PCE		link's threshold. Based on the current state of the network, PCE
	within CCDR framework combines the shortest path algorithm with		within CCDR framework combines the shortest path algorithm with
	penalty theory of classical optimization and graph theory.		penalty theory of classical optimization and graph theory.
	Given background traffic matrix which is unscheduled, when a set of		Given background traffic matrix which is unscheduled, when a set of
	new flows comes into the network, the end-to-end path optimization		new flows comes into the network, the end-to-end path optimization
	finds the optimal paths for them. The selected paths bring the least		finds the optimal paths for them. The selected paths bring the least
	skipping to change at page 9, line 5 ¶		skipping to change at page 9, line 5 ¶
	| |		| |
	20| |		20| |
	| *|		| *|
	| * *|		| * *|
	| * * * * * ** * *|		| * * * * * ** * *|
	0+-----------------------------------------------------------+		0+-----------------------------------------------------------+
	0 100 200 300 400 500 600 700 800 900 1000		0 100 200 300 400 500 600 700 800 900 1000
	Flow Number		Flow Number
	Fig.6 Simulation Result with Congestion Elimination		Fig.6 Simulation Result with Congestion Elimination
	4.4. Network Temporal Congestion Elimination		3.4. Network Temporal Congestion Elimination
	Different degree of network congestions are simulated. The		Different degree of network congestions are simulated. The
	congestion degree (CD) is defined as the link utilization beyond its		congestion degree (CD) is defined as the link utilization beyond its
	threshold.		threshold.
	The CCDR congestion elimination performance is shown in Fig.7. The		The CCDR congestion elimination performance is shown in Fig.7. The
	first graph is the congestion degree before the process of congestion		first graph is the congestion degree before the process of congestion
	elimination. The average CD of all congested links is more than 10%.		elimination. The average CD of all congested links is more than 10%.
	The second graph shown in Fig.7 is the congestion degree after		The second graph shown in Fig.7 is the congestion degree after
	congestion elimination process. It shows only 12 links among totally		congestion elimination process. It shows only 12 links among totally
	skipping to change at page 10, line 43 ¶		skipping to change at page 10, line 43 ¶
	| |		| |
	| |		| |
	5 | |		5 | |
	| |		| |
	| * ** * * * ** * ** * |		| * ** * * * ** * ** * |
	0 +-----------------------------------------------------------+		0 +-----------------------------------------------------------+
	0 0.5 1 1.5 2		0 0.5 1 1.5 2
	Link Number(*10000)		Link Number(*10000)
	Fig.7 Simulation Result with Congestion Elimination		Fig.7 Simulation Result with Congestion Elimination
	5. CCDR Deployment Consideration.		4. CCDR Deployment Consideration.
	With the above CCDR scenarios and simulation results, we can know it		With the above CCDR scenarios and simulation results, we can know it
	is necessary and feasible to find one general solution to cope with		is necessary and feasible to find one general solution to cope with
	various complex situations for the complex optimal path computation		various complex situations for the complex optimal path computation
	in centrally manner based on the underlay network topology and the		in centrally manner based on the underlay network topology and the
	real time traffic.		real time traffic.
	[I-D.ietf-teas-pce-native-ip] gives the solution for above scenarios,		[I-D.ietf-teas-pce-native-ip] gives the solution for above scenarios,
	such thoughts can be extended to cover requirements in other		such thoughts can be extended to cover requirements in other
	situations in future.		situations in future.
	6. Security Considerations		5. Security Considerations
	This document considers mainly the integration of distributed		This document considers mainly the integration of distributed
	protocol and the central control capability of PCE/SDN. It certainly		protocol and the central control capability of PCE/SDN. It certainly
	can ease the management of network in various traffic-engineering		can ease the management of network in various traffic-engineering
	scenarios described in this document, but the central control manner		scenarios described in this document, but the central control manner
	also bring the new point that may be easily attacked. Solutions for		also bring the new point that may be easily attacked. Solutions for
	CCDR scenarios should keep these in mind and consider more for the		CCDR scenarios should keep these in mind and consider more for the
	protection of PCE/SDN controller and their communication with the		protection of PCE/SDN controller and their communication with the
	underlay devices, as that described in document [RFC5440] and		underlay devices, as that described in document [RFC5440] and
	[RFC8253]		[RFC8253]
	7. IANA Considerations		6. IANA Considerations
	This document does not require any IANA actions.		This document does not require any IANA actions.
	8. Contributors		7. Contributors
	Lu Huang contributes to the content of this draft.		Lu Huang contributes to the content of this draft.
	9. Acknowledgement		8. Acknowledgement
	The author would like to thank Deborah Brungard, Adrian Farrel,		The author would like to thank Deborah Brungard, Adrian Farrel,
	Huaimo Chen, Vishnu Beeram and Lou Berger for their supports and		Huaimo Chen, Vishnu Beeram and Lou Berger for their supports and
	comments on this draft.		comments on this draft.
	10. Normative References		9. References
	[I-D.ietf-detnet-dp-sol-ip]
	Korhonen, J. and B. Varga, "DetNet IP Data Plane
	Encapsulation", draft-ietf-detnet-dp-sol-ip-02 (work in
	progress), March 2019.
	[I-D.ietf-pce-pcep-extension-native-ip]		9.1. Normative References
	Wang, A., Khasanov, B., Cheruathur, S., Zhu, C., and S.
	Fang, "PCEP Extension for Native IP Network", draft-ietf-
	pce-pcep-extension-native-ip-03 (work in progress), March
	2019.
	[I-D.ietf-teas-pce-native-ip]		[I-D.ietf-teas-pce-native-ip]
	Wang, A., Zhao, Q., Khasanov, B., Chen, H., and R. Mallya,		Wang, A., Zhao, Q., Khasanov, B., Chen, H., and R. Mallya,
	"PCE in Native IP Network", draft-ietf-teas-pce-native-		"PCE in Native IP Network", draft-ietf-teas-pce-native-
	ip-03 (work in progress), April 2019.		ip-03 (work in progress), April 2019.
	[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
	Requirement Levels", BCP 14, RFC 2119,
	DOI 10.17487/RFC2119, March 1997,
	<https://www.rfc-editor.org/info/rfc2119>.
	[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,
	<https://www.rfc-editor.org/info/rfc5440>.		<https://www.rfc-editor.org/info/rfc5440>.
	[RFC8253] Lopez, D., Gonzalez de Dios, O., Wu, Q., and D. Dhody,		[RFC8253] Lopez, D., Gonzalez de Dios, O., Wu, Q., and D. Dhody,
	"PCEPS: Usage of TLS to Provide a Secure Transport for the		"PCEPS: Usage of TLS to Provide a Secure Transport for the
	Path Computation Element Communication Protocol (PCEP)",		Path Computation Element Communication Protocol (PCEP)",
	RFC 8253, DOI 10.17487/RFC8253, October 2017,		RFC 8253, DOI 10.17487/RFC8253, October 2017,
	<https://www.rfc-editor.org/info/rfc8253>.		<https://www.rfc-editor.org/info/rfc8253>.
			9.2. Informative References
	[RFC8578] Grossman, E., Ed., "Deterministic Networking Use Cases",		[RFC8578] Grossman, E., Ed., "Deterministic Networking Use Cases",
	RFC 8578, DOI 10.17487/RFC8578, May 2019,		RFC 8578, DOI 10.17487/RFC8578, May 2019,
	<https://www.rfc-editor.org/info/rfc8578>.		<https://www.rfc-editor.org/info/rfc8578>.
	Authors' Addresses		Authors' Addresses
	Aijun Wang		Aijun Wang
	China Telecom		China Telecom
	Beiqijia Town, Changping District		Beiqijia Town, Changping District
	Beijing, Beijing 102209		Beijing, Beijing 102209
End of changes. 26 change blocks.
	69 lines changed or deleted		47 lines changed or added
This html diff was produced by rfcdiff 1.47. The latest version is available from http://tools.ietf.org/tools/rfcdiff/