draft-ietf-quic-recovery-29.txt		draft-ietf-quic-recovery-latest.txt
	QUIC Working Group J. Iyengar, Ed.		QUIC Working Group J. Iyengar, Ed.
	Internet-Draft Fastly		Internet-Draft Fastly
	Intended status: Standards Track I. Swett, Ed.		Intended status: Standards Track I. Swett, Ed.
	Expires: December 11, 2020 Google		Expires: January 2, 2021 Google
	June 9, 2020		July 1, 2020
	QUIC Loss Detection and Congestion Control		QUIC Loss Detection and Congestion Control
	draft-ietf-quic-recovery-29		draft-ietf-quic-recovery-latest
	Abstract		Abstract
	This document describes loss detection and congestion control		This document describes loss detection and congestion control
	mechanisms for QUIC.		mechanisms for QUIC.
	Note to Readers		Note to Readers
	Discussion of this draft takes place on the QUIC working group		Discussion of this draft takes place on the QUIC working group
	mailing list (quic@ietf.org [1]), which is archived at		mailing list (quic@ietf.org [1]), which is archived at
	skipping to change at page 1, line 42 ¶		skipping to change at page 1, line 42 ¶
	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 11, 2020.		This Internet-Draft will expire on January 2, 2021.
	Copyright Notice		Copyright Notice
	Copyright (c) 2020 IETF Trust and the persons identified as the		Copyright (c) 2020 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
	skipping to change at page 24, line 46 ¶		skipping to change at page 24, line 46 ¶
	9. IANA Considerations		9. IANA Considerations
	This document has no IANA actions.		This document has no IANA actions.
	10. References		10. References
	10.1. Normative References		10.1. Normative References
	[QUIC-TLS]		[QUIC-TLS]
	Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure		Thomson, M., Ed. and S. Turner, Ed., "Using TLS to Secure
	QUIC", draft-ietf-quic-tls-29 (work in progress).		QUIC", draft-ietf-quic-tls-latest (work in progress).
	[QUIC-TRANSPORT]		[QUIC-TRANSPORT]
	Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based		Iyengar, J., Ed. and M. Thomson, Ed., "QUIC: A UDP-Based
	Multiplexed and Secure Transport", draft-ietf-quic-		Multiplexed and Secure Transport", draft-ietf-quic-
	transport-29 (work in progress).		transport-latest (work in progress).
	[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,		Requirement Levels", BCP 14, RFC 2119,
	DOI 10.17487/RFC2119, March 1997,		DOI 10.17487/RFC2119, March 1997,
	<https://www.rfc-editor.org/info/rfc2119>.		<https://www.rfc-editor.org/info/rfc2119>.
	[RFC8085] Eggert, L., Fairhurst, G., and G. Shepherd, "UDP Usage		[RFC8085] Eggert, L., Fairhurst, G., and G. Shepherd, "UDP Usage
	Guidelines", BCP 145, RFC 8085, DOI 10.17487/RFC8085,		Guidelines", BCP 145, RFC 8085, DOI 10.17487/RFC8085,
	March 2017, <https://www.rfc-editor.org/info/rfc8085>.		March 2017, <https://www.rfc-editor.org/info/rfc8085>.
	skipping to change at page 34, line 9 ¶		skipping to change at page 34, line 9 ¶
	When the loss detection timer expires, the timer's mode determines		When the loss detection timer expires, the timer's mode determines
	the action to be performed.		the action to be performed.
	Pseudocode for OnLossDetectionTimeout follows:		Pseudocode for OnLossDetectionTimeout follows:
	OnLossDetectionTimeout():		OnLossDetectionTimeout():
	earliest_loss_time, pn_space = GetLossTimeAndSpace()		earliest_loss_time, pn_space = GetLossTimeAndSpace()
	if (earliest_loss_time != 0):		if (earliest_loss_time != 0):
	// Time threshold loss Detection		// Time threshold loss Detection
	lost_packets = DetectLostPackets(pn_space)		lost_packets = DetectAndRemoveLostPackets(pn_space)
	assert(!lost_packets.empty())		assert(!lost_packets.empty())
	OnPacketsLost(lost_packets)		OnPacketsLost(lost_packets)
	SetLossDetectionTimer()		SetLossDetectionTimer()
	return		return
	if (bytes_in_flight > 0):		if (bytes_in_flight > 0):
	// PTO. Send new data if available, else retransmit old data.		// PTO. Send new data if available, else retransmit old data.
	// If neither is available, send a single PING frame.		// If neither is available, send a single PING frame.
	_, pn_space = GetPtoTimeAndSpace()		_, pn_space = GetPtoTimeAndSpace()
	SendOneOrTwoAckElicitingPackets(pn_space)		SendOneOrTwoAckElicitingPackets(pn_space)
	skipping to change at page 38, line 36 ¶		skipping to change at page 38, line 36 ¶
	ProcessECN(ack, pn_space):		ProcessECN(ack, pn_space):
	// If the ECN-CE counter reported by the peer has increased,		// If the ECN-CE counter reported by the peer has increased,
	// this could be a new congestion event.		// this could be a new congestion event.
	if (ack.ce_counter > ecn_ce_counters[pn_space]):		if (ack.ce_counter > ecn_ce_counters[pn_space]):
	ecn_ce_counters[pn_space] = ack.ce_counter		ecn_ce_counters[pn_space] = ack.ce_counter
	CongestionEvent(sent_packets[ack.largest_acked].time_sent)		CongestionEvent(sent_packets[ack.largest_acked].time_sent)
	B.8. On Packets Lost		B.8. On Packets Lost
	Invoked from DetectLostPackets when packets are deemed lost.		Invoked when DetectAndRemoveLostPackets deems packets lost.
	InPersistentCongestion(lost_packets):		InPersistentCongestion(lost_packets):
	pto = smoothed_rtt + max(4 * rttvar, kGranularity) +		pto = smoothed_rtt + max(4 * rttvar, kGranularity) +
	max_ack_delay		max_ack_delay
	congestion_period = pto * kPersistentCongestionThreshold		congestion_period = pto * kPersistentCongestionThreshold
	// Determine if all packets in the time period before the		// Determine if all packets in the time period before the
	// largest newly lost packet, including the edges, are		// largest newly lost packet, including the edges, are
	// marked lost		// marked lost
	return AreAllPacketsLost(lost_packets, congestion_period)		return AreAllPacketsLost(lost_packets, congestion_period)
End of changes. 7 change blocks.
	8 lines changed or deleted		8 lines changed or added
This html diff was produced by rfcdiff 1.44jr. The latest version is available from http://tools.ietf.org/tools/rfcdiff/