draft-ietf-quic-recovery-05.txt   draft-ietf-quic-recovery-latest.txt 
QUIC Working Group J. Iyengar, Ed. QUIC Working Group J. Iyengar, Ed.
Internet-Draft I. Swett, Ed. Internet-Draft I. Swett, Ed.
Intended status: Standards Track Google Intended status: Standards Track Google
Expires: dating sites free no credit card needed February 16, 2018 August 15, 2017 Expires: www.partnersuche ukraine March 16, 2018 September 12, 2017
QUIC Loss Detection and Congestion Control QUIC Loss Detection and Congestion Control
single party stuttgart draft-ietf-quic-recovery-05 single events stuttgart 2014 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 ([email protected]), which is archived at mailing list ([email protected]), which is archived at
https://mailarchive.ietf.org/arch/search/?email_list=quic. https://mailarchive.ietf.org/arch/search/?email_list=quicsingle party stuttgart 2015 [1].
Working Group information can be found at berlin partnersuche https://github.com/quicwg; Working Group information can be found at partnersuche berlin brandenburg https://github.com/quicwg
source code and issues list for this draft can be found at partnersuche berlin ab 40 [2]; source code and issues list for this draft can be found at
partnersuche berlin ab 50 https://github.com/quicwg/base-drafts/labels/recovery. free dating websites in montreal https://github.com/quicwg/base-drafts/labels/recovery [3].
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at httpfree dating in montreal s://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 single events hessen February 16, 2018. This Internet-Draft will expire on how to start a conversation on a dating site examples March 16, 2018.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (httphow to start a conversation on an online dating site s://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 . . . . . . . . . . . . . . . . . . . . . . . . 3
skipping to change at page 2, line 26how do you start a conversation on an online dating site ¶ skipping to change at page 2, line 26christliche singles app ¶
2. Design of the QUIC Transmission Machinery . . . . . . . . . . 3 2. Design of the QUIC Transmission Machinery . . . . . . . . . . 3
2.1. Relevant Differences Between QUIC and TCP . . . . . . . . 4 2.1. Relevant Differences Between QUIC and TCP . . . . . . . . 4
2.1.1. Monotonically Increasing Packet Numbers . . . . . . . 4 2.1.1. Monotonically Increasing Packet Numbers . . . . . . . 4
2.1.2. No Reneging . . . . . . . . . . . . . . . . . . . . . 4 2.1.2. No Reneging . . . . . . . . . . . . . . . . . . . . . 4
2.1.3. More ACK Ranges . . . . . . . . . . . . . . . . . . . 5 2.1.3. More ACK Ranges . . . . . . . . . . . . . . . . . . . 5
2.1.4. Explicit Correction For Delayed Acks . . . . . . . . 5 2.1.4. Explicit Correction For Delayed Acks . . . . . . . . 5
3. Loss Detection . . . . . . . . . . . . . . . . . . . . . . . 5 3. Loss Detection . . . . . . . . . . . . . . . . . . . . . . . 5
3.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 5
3.2. Algorithm Details . . . . . . . . . . . . . . . . . . . . 6 3.2. Algorithm Details . . . . . . . . . . . . . . . . . . . . 6
3.2.1. Constants of interest . . . . . . . . . . . . . . . . 6 3.2.1. Constants of interest . . . . . . . . . . . . . . . . 6
3.2.2. Variables of interest . . . . . . . . . . . . . . . . single party köln ü40 6 3.2.2. Variables of interest . . . . . . . . . . . . . . . . single party köln silvester 7
3.2.3. Initialization . . . . . . . . . . . . . . . . . . . 8 3.2.3. Initialization . . . . . . . . . . . . . . . . . . . 8
3.2.4. On Sending a Packet . . . . . . . . . . . . . . . . . 8 3.2.4. On Sending a Packet . . . . . . . . . . . . . . . . . 8
3.2.5. On Ack Receipt . . . . . . . . . . . . . . . . . . . 9 3.2.5. On Ack Receipt . . . . . . . . . . . . . . . . . . . 9
3.2.6. On Packet Acknowledgment . . . . . . . . . . . . . . 9 3.2.6. On Packet Acknowledgment . . . . . . . . . . . . . . 9
3.2.7. Setting the Loss Detection Alarm . . . . . . . . . . 10 3.2.7. Setting the Loss Detection Alarm . . . . . . . . . . 10
3.2.8. On Alarm Firing . . . . . . . . . . . . . . . . . . . 12 3.2.8. On Alarm Firing . . . . . . . . . . . . . . . . . . . 12
3.2.9. Detecting Lost Packets . . . . . . . . . . . . . . . 13 3.2.9. Detecting Lost Packets . . . . . . . . . . . . . . . 13
3.3. Discussion . . . . . . . . . . . . . . . . . . . . . . . 14 3.3. Discussion . . . . . . . . . . . . . . . . . . . . . . . 14
4. Congestion Control . . . . . . . . . . . . . . . . . . . . . 14 4. Congestion Control . . . . . . . . . . . . . . . . . . . . . 14
4.1. Slow Start . . . . . . . . . . . . . . . . . . . . . . . 15 4.1. Slow Start . . . . . . . . . . . . . . . . . . . . . . . 15
skipping to change at page 2, line 49single events köln ¶ skipping to change at page 2, line 49single party köln 2013 ¶
4.4. Variables of interest . . . . . . . . . . . . . . . . . . 15 4.4. Variables of interest . . . . . . . . . . . . . . . . . . 15
4.5. Initialization . . . . . . . . . . . . . . . . . . . . . 16 4.5. Initialization . . . . . . . . . . . . . . . . . . . . . 16
4.6. On Packet Acknowledgement . . . . . . . . . . . . . . . . 16 4.6. On Packet Acknowledgement . . . . . . . . . . . . . . . . 16
4.7. On Packets Lost . . . . . . . . . . . . . . . . . . . . . 16 4.7. On Packets Lost . . . . . . . . . . . . . . . . . . . . . 16
4.8. On Retransmission Timeout Verified . . . . . . . . . . . 17 4.8. On Retransmission Timeout Verified . . . . . . . . . . . 17
4.9. Pacing Packets . . . . . . . . . . . . . . . . . . . . . 17 4.9. Pacing Packets . . . . . . . . . . . . . . . . . . . . . 17
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 17 5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 17
6. References . . . . . . . . . . . . . . . . . . . . . . . . . 17 6. References . . . . . . . . . . . . . . . . . . . . . . . . . 17
6.1. Normative References . . . . . . . . . . . . . . . . . . 17 6.1. Normative References . . . . . . . . . . . . . . . . . . 17
6.2. Informative References . . . . . . . . . . . . . . . . . 17 6.2. Informative References . . . . . . . . . . . . . . . . . 17
free online australian chat rooms 6.3. URIs . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 18 Appendix A. Acknowledgments . . . . . . . . . . . . . . . . . . 18
Appendix B. Change Log . . . . . . . . . . . . . . . . . . . . . 18 Appendix B. Change Log . . . . . . . . . . . . . . . . . . . . . 18
B.1. Since draft-ietf-quic-recovery-04 . . . . . . . . . . . . 18 B.1. Since draft-ietf-quic-recovery-04 . . . . . . . . . . . . 18
B.2. Since draft-ietf-quic-recovery-03 . . . . . . . . . . . . muslim partnersuche 18 B.2. Since draft-ietf-quic-recovery-03 . . . . . . . . . . . . single party berlin 2014 19
B.3. Since draft-ietf-quic-recovery-02 . . . . . . . . . . . . single party berlin goya 18 B.3. Since draft-ietf-quic-recovery-02 . . . . . . . . . . . . single party berlin ü30 19
B.4. Since draft-ietf-quic-recovery-01 . . . . . . . . . . . . 19 B.4. Since draft-ietf-quic-recovery-01 . . . . . . . . . . . . 19
B.5. Since draft-ietf-quic-recovery-00 . . . . . . . . . . . . 19 B.5. Since draft-ietf-quic-recovery-00 . . . . . . . . . . . . 19
B.6. Since draft-iyengar-quic-loss-recovery-01 . . . . . . . . 19 B.6. Since draft-iyengar-quic-loss-recovery-01 . . . . . . . . 19
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 19 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 19
1. Introduction 1. Introduction
QUIC is a new multiplexed and secure transport atop UDP. QUIC builds QUIC is a new multiplexed and secure transport atop UDP. QUIC builds
on decades of transport and security experience, and implements on decades of transport and security experience, and implements
mechanisms that make it attractive as a modern general-purpose mechanisms that make it attractive as a modern general-purpose
skipping to change at page 6, line 8single party berlin silvester ¶ skipping to change at page 6, line 12single party berlin ü40 ¶
The sender therefore relies on an alarm to detect such tail The sender therefore relies on an alarm to detect such tail
losses. This mechanism is based on TCP's Tail Loss Probe. losses. This mechanism is based on TCP's Tail Loss Probe.
o If all else fails, a Retransmission Timeout (RTO) alarm is always o If all else fails, a Retransmission Timeout (RTO) alarm is always
set when any retransmittable packet is outstanding. When this set when any retransmittable packet is outstanding. When this
alarm fires, all unacknowledged packets are marked as lost. alarm fires, all unacknowledged packets are marked as lost.
o Instead of a packet threshold to tolerate reordering, a QUIC o Instead of a packet threshold to tolerate reordering, a QUIC
sender may use a time threshold. This allows for senders to be sender may use a time threshold. This allows for senders to be
tolerant of short periods of significant reordering. In this tolerant of short periods of significant reordering. In this
mechanism, a QUIC sender marks a packet as lost when a best free singles chat app packet mechanism, a QUIC sender marks a packet as lost when a larger
larger sims 3 kostenlos spielen than it is acknowledged and a threshold amount of time has sims 3 kostenlos spielen deutsch packet number is acknowledged and a threshold amount of time has
passed since the packet was sent. passed since the packet was sent.
o Handshake packets, which contain STREAM frames for stream 0, are o Handshake packets, which contain STREAM frames for stream 0, are
critical to QUIC transport and crypto negotiation, so a separate critical to QUIC transport and crypto negotiation, so a separate
alarm period is used for them. alarm period is used for them.
3.2. Algorithm Details 3.2. Algorithm Details
3.2.1. Constants of interest 3.2.1. Constants of interest
skipping to change at page 12, line 23best way to open online dating ¶ skipping to change at page 12, line 23seriöse türkische partnervermittlung ¶
alarm_duration = 2 * kDefaultInitialRtt alarm_duration = 2 * kDefaultInitialRtt
else: else:
alarm_duration = 2 * smoothed_rtt alarm_duration = 2 * smoothed_rtt
alarm_duration = max(alarm_duration, kMinTLPTimeout) alarm_duration = max(alarm_duration, kMinTLPTimeout)
alarm_duration = alarm_duration * (2 ^ handshake_count) alarm_duration = alarm_duration * (2 ^ handshake_count)
else if (loss_time != 0): else if (loss_time != 0):
// Early retransmit timer or time loss detection. // Early retransmit timer or time loss detection.
alarm_duration = loss_time - now alarm_duration = loss_time - now
else if (tlp_count < kMaxTLPs): else if (tlp_count < kMaxTLPs):
// Tail Loss Probe // Tail Loss Probe
if (retransmittable_packets_outstanding = 1): if (retransmittable_packets_outstanding =türkische partnervermittlung kostenlos = 1):
alarm_duration = 1.5 * smoothed_rtt + kDelayedAckTimeout alarm_duration = 1.5 * smoothed_rtt + kDelayedAckTimeout
else: else:
alarm_duration = kMinTLPTimeout alarm_duration = kMinTLPTimeout
alarm_duration = max(alarm_duration, 2 * smoothed_rtt) alarm_duration = max(alarm_duration, 2 * smoothed_rtt)
else: else:
// RTO alarm // RTO alarm
alarm_duration = smoothed_rtt + 4 * rttvar alarm_duration = smoothed_rtt + 4 * rttvar
alarm_duration = max(alarm_duration, kMinRTOTimeout) alarm_duration = max(alarm_duration, kMinRTOTimeout)
alarm_duration = alarm_duration * (2 ^ rto_count) alarm_duration = alarm_duration * (2 ^ rto_count)
skipping to change at page 17, line 45türkische partnervermittlung ¶ skipping to change at page 17, line 45free dating websites over 50 ¶
6.1. Normative References 6.1. Normative References
[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-latest (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, dating over 50 free <https://www.rfc- DOI 10.17487/RFC2119, March 1997,
dating sites over 50's free editor.org/info/rfc2119>. akademiker auf partnersuche <https://www.rfc-editor.org/info/rfc2119>.
6.2. Informative References 6.2. Informative References
[LOSS-PROBE] [LOSS-PROBE]
Dukkipati, N., Cardwell, N., Cheng, Y., and M. Mathis, Dukkipati, N., Cardwell, N., Cheng, Y., and M. Mathis,
"Tail Loss Probe (TLP): An Algorithm for Fast Recovery of "Tail Loss Probe (TLP): An Algorithm for Fast Recovery of
Tail Losses", draft-dukkipati-tcpm-tcp-loss-probe-01 (work Tail Losses", draft-dukkipati-tcpm-tcp-loss-probe-01 (work
in progress), February 2013. in progress), February 2013.
[RFC5682] Sarolahti, P., Kojo, M., Yamamoto, K., and M. Hata, [RFC5682] Sarolahti, P., Kojo, M., Yamamoto, K., and M. Hata,
"Forward RTO-Recovery (F-RTO): An Algorithm for Detecting "Forward RTO-Recovery (F-RTO): An Algorithm for Detecting
Spurious Retransmission Timeouts with TCP", RFC 5682, Spurious Retransmission Timeouts with TCP", RFC 5682,
DOI 10.17487/RFC5682, September 2009, jahreshoroskop 2013 kostenlos cosmopolitan <https://www.rfc- DOI 10.17487/RFC5682, September 2009,
jahreshoroskop 2013 kostenlos fische editor.org/info/rfc5682>. chinesisches jahreshoroskop 2013 kostenlos <https://www.rfc-editor.org/info/rfc5682>.
[RFC5827] Allman, M., Avrachenkov, K., Ayesta, U., Blanton, J., and [RFC5827] Allman, M., Avrachenkov, K., Ayesta, U., Blanton, J., and
P. Hurtig, "Early Retransmit for TCP and Stream Control P. Hurtig, "Early Retransmit for TCP and Stream Control
Transmission Protocol (SCTP)", RFC 5827, Transmission Protocol (SCTP)", RFC 5827,
DOI 10.17487/RFC5827, May 2010, partnersuche türkische frauen <https://www.rfc- DOI 10.17487/RFC5827, May 2010,
türkische partnersuche editor.org/info/rfc5827>. single party würzburg 2013 <https://www.rfc-editor.org/info/rfc5827>.
[RFC6298] Paxson, V., Allman, M., Chu, J., and M. Sargent, [RFC6298] Paxson, V., Allman, M., Chu, J., and M. Sargent,
"Computing TCP's Retransmission Timer", RFC 6298, "Computing TCP's Retransmission Timer", RFC 6298,
DOI 10.17487/RFC6298, June 2011, single party würzburg <https://www.rfc- DOI 10.17487/RFC6298, June 2011,
single party hannover heute editor.org/info/rfc6298>. single party hannover <https://www.rfc-editor.org/info/rfc6298>.
[RFC6582] Henderson, T., Floyd, S., Gurtov, A., and Y. Nishida, "The [RFC6582] Henderson, T., Floyd, S., Gurtov, A., and Y. Nishida, "The
NewReno Modification to TCP's Fast Recovery Algorithm", NewReno Modification to TCP's Fast Recovery Algorithm",
RFC 6582, DOI 10.17487/RFC6582, April 2012, RFC 6582, DOI 10.17487/RFC6582, April 2012,
<https://www.rfc-editor.org/info/rfc6582>. <https://www.rfc-editor.org/info/rfc6582>.
single party hannover 2013 6.3. URIs
single party hannover brauhaus
free date chat online [1] https://mailarchive.ietf.org/arch/search/?email_list=quic
partnerbörse kostenlos ab 50
partnerbörse kostenlos [2] https://github.com/quicwg
free online chat rooms no registration usa
free online chat rooms no registration required [3] https://github.com/quicwg/base-drafts/labels/recovery
Appendix A. Acknowledgments Appendix A. Acknowledgments
Appendix B. Change Log Appendix B. Change Log
*RFC Editor's Note:* Please remove this section prior to *RFC Editor's Note:* Please remove this section prior to
publication of a final version of this document. publication of a final version of this document.
B.1. Since draft-ietf-quic-recovery-04 B.1. Since draft-ietf-quic-recovery-04
No significant changes. No significant changes.
 End of changes. 17 change blocks. 
free depression chat rooms uk 23 lines changed or deletedfree dating websites for over 50s 100 free dating sites over 50 32 lines changed or added

This html diff was produced by rfcdiff 1.44jr. The latest version is available from single männer ab 30