< draft-ietf-tsvwg-l4s-arch-19.txt   draft-ietf-tsvwg-l4s-arch-20a.txt >
Transport Area Working Group B. Briscoe, Ed. Transport Area Working Group B. Briscoe, Ed.
Internet-Draft Independent Internet-Draft Independent
Intended status: Informational K. De Schepper Intended status: Informational K. De Schepper
Expires: 28 January 2023 Nokia Bell Labs Expires: 25 February 2023 Nokia Bell Labs
M. Bagnulo Braun M. Bagnulo Braun
Universidad Carlos III de Madrid Universidad Carlos III de Madrid
G. White G. White
CableLabs CableLabs
27 July 2022 24 August 2022
Low Latency, Low Loss, Scalable Throughput (L4S) Internet Service: Low Latency, Low Loss, Scalable Throughput (L4S) Internet Service:
Architecture Architecture
draft-ietf-tsvwg-l4s-arch-19 draft-ietf-tsvwg-l4s-arch-20
Abstract Abstract
This document describes the L4S architecture, which enables Internet This document describes the L4S architecture, which enables Internet
applications to achieve Low queuing Latency, Low Loss, and Scalable applications to achieve Low queuing Latency, Low Loss, and Scalable
throughput (L4S). The insight on which L4S is based is that the root throughput (L4S). L4S is based on the insight that the root cause of
cause of queuing delay is in the congestion controllers of senders, queuing delay is in the capacity-seeking congestion controllers of
not in the queue itself. With the L4S architecture all Internet senders, not in the queue itself. With the L4S architecture all
applications could (but do not have to) transition away from Internet applications could (but do not have to) transition away from
congestion control algorithms that cause substantial queuing delay, congestion control algorithms that cause substantial queuing delay,
to a new class of congestion controls that induce very little to a new class of congestion controls that can seek capacity with
queuing, aided by explicit congestion signalling from the network. very little queuing. These are aided by a modified form of explicit
This new class of congestion controls can provide low latency for congestion notification from the network, which is defined separately
capacity-seeking flows, so applications can achieve both high as an experimental change to ECN. With this new architecture
bandwidth and low latency. applications can have both low latency and high throughput.
The architecture primarily concerns incremental deployment. It The architecture primarily concerns incremental deployment. It
defines mechanisms that allow the new class of L4S congestion defines mechanisms that allow the new class of L4S congestion
controls to coexist with 'Classic' congestion controls in a shared controls to coexist with 'Classic' congestion controls in a shared
network. These mechanisms aim to ensure that the latency and network. The aim is for L4S latency and throughput to be usually
throughput performance using an L4S-compliant congestion controller much better (and rarely worse), while typically not impacting Classic
is usually much better (and rarely worse) than performance would have performance.
been using a 'Classic' congestion controller, and that competing
flows continuing to use 'Classic' controllers are typically not
impacted by the presence of L4S. These characteristics are important
to encourage adoption of L4S congestion control algorithms and L4S
compliant network elements.
The L4S architecture consists of three components: network support to
isolate L4S traffic from classic traffic; protocol features that
allow network elements to identify L4S traffic; and host support for
L4S congestion controls. The protocol is defined separately as an
experimental change to Explicit Congestion Notification (ECN).
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 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 28 January 2023. This Internet-Draft will expire on 25 February 2023.
Copyright Notice Copyright Notice
Copyright (c) 2022 IETF Trust and the persons identified as the Copyright (c) 2022 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 (https://trustee.ietf.org/ Provisions Relating to IETF Documents (https://trustee.ietf.org/
license-info) in effect on the date of publication of this document. license-info) in effect on the date of publication of this document.
Please review these documents carefully, as they describe your rights Please review these documents carefully, as they describe your rights
skipping to change at page 3, line 48 skipping to change at page 3, line 38
important because, for interactive applications, losses translate important because, for interactive applications, losses translate
into even longer retransmission delays. into even longer retransmission delays.
It has been demonstrated that, once access network bit rates reach It has been demonstrated that, once access network bit rates reach
levels now common in the developed world, increasing link capacity levels now common in the developed world, increasing link capacity
offers diminishing returns if latency (delay) is not addressed offers diminishing returns if latency (delay) is not addressed
[Dukkipati06], [Rajiullah15]. Therefore, the goal is an Internet [Dukkipati06], [Rajiullah15]. Therefore, the goal is an Internet
service with very Low queueing Latency, very Low Loss and Scalable service with very Low queueing Latency, very Low Loss and Scalable
throughput (L4S). Very low queuing latency means less than throughput (L4S). Very low queuing latency means less than
1 millisecond (ms) on average and less than about 2 ms at the 99th 1 millisecond (ms) on average and less than about 2 ms at the 99th
percentile. This document describes the L4S architecture for percentile. End-to-end delay above 50 ms [Raaen14] or even above
achieving these goals. 20 ms [NASA04] starts to feel unnatural for more demanding
interactive applications. So removing unnecessary delay variability
increases the reach of these applications (the distance over which
they are comfortable to use). This document describes the L4S
architecture for achieving these goals.
Differentiated services (Diffserv) offers Expedited Forwarding Differentiated services (Diffserv) offers Expedited Forwarding
(EF [RFC3246]) for some packets at the expense of others, but this (EF [RFC3246]) for some packets at the expense of others, but this
makes no difference when all (or most) of the traffic at a bottleneck makes no difference when all (or most) of the traffic at a bottleneck
at any one time requires low latency. In contrast, L4S still works at any one time requires low latency. In contrast, L4S still works
well when all traffic is L4S - a service that gives without taking well when all traffic is L4S - a service that gives without taking
needs none of the configuration or management baggage (traffic needs none of the configuration or management baggage (traffic
policing, traffic contracts) associated with favouring some traffic policing, traffic contracts) associated with favouring some traffic
flows over others. flows over others.
skipping to change at page 37, line 35 skipping to change at page 37, line 35
[Hohlfeld14] [Hohlfeld14]
Hohlfeld, O., Pujol, E., Ciucu, F., Feldmann, A., and P. Hohlfeld, O., Pujol, E., Ciucu, F., Feldmann, A., and P.
Barford, "A QoE Perspective on Sizing Network Buffers", Barford, "A QoE Perspective on Sizing Network Buffers",
Proc. ACM Internet Measurement Conf (IMC'14) hmm, November Proc. ACM Internet Measurement Conf (IMC'14) hmm, November
2014, <http://doi.acm.org/10.1145/2663716.2663730>. 2014, <http://doi.acm.org/10.1145/2663716.2663730>.
[I-D.briscoe-conex-policing] [I-D.briscoe-conex-policing]
Briscoe, B., "Network Performance Isolation using Briscoe, B., "Network Performance Isolation using
Congestion Policing", Work in Progress, Internet-Draft, Congestion Policing", Work in Progress, Internet-Draft,
draft-briscoe-conex-policing-01, 14 February 2014, draft-briscoe-conex-policing-01, 14 February 2014,
<https://datatracker.ietf.org/doc/html/draft-briscoe- <https://www.ietf.org/archive/id/draft-briscoe-conex-
conex-policing-01>. policing-01.txt>.
[I-D.briscoe-docsis-q-protection] [I-D.briscoe-docsis-q-protection]
Briscoe, B. and G. White, "The DOCSIS(r) Queue Protection Briscoe, B. and G. White, "The DOCSIS(r) Queue Protection
Algorithm to Preserve Low Latency", Work in Progress, Algorithm to Preserve Low Latency", Work in Progress,
Internet-Draft, draft-briscoe-docsis-q-protection-06, 13 Internet-Draft, draft-briscoe-docsis-q-protection-06, 13
May 2022, <https://datatracker.ietf.org/doc/html/draft- May 2022, <https://www.ietf.org/archive/id/draft-briscoe-
briscoe-docsis-q-protection-06>. docsis-q-protection-06.txt>.
[I-D.briscoe-iccrg-prague-congestion-control] [I-D.briscoe-iccrg-prague-congestion-control]
Schepper, K. D., Tilmans, O., and B. Briscoe, "Prague Schepper, K. D., Tilmans, O., and B. Briscoe, "Prague
Congestion Control", Work in Progress, Internet-Draft, Congestion Control", Work in Progress, Internet-Draft,
draft-briscoe-iccrg-prague-congestion-control-01, 11 July draft-briscoe-iccrg-prague-congestion-control-01, 11 July
2022, <https://datatracker.ietf.org/doc/html/draft- 2022, <https://www.ietf.org/archive/id/draft-briscoe-
briscoe-iccrg-prague-congestion-control-01>. iccrg-prague-congestion-control-01.txt>.
[I-D.briscoe-tsvwg-l4s-diffserv] [I-D.briscoe-tsvwg-l4s-diffserv]
Briscoe, B., "Interactions between Low Latency, Low Loss, Briscoe, B., "Interactions between Low Latency, Low Loss,
Scalable Throughput (L4S) and Differentiated Services", Scalable Throughput (L4S) and Differentiated Services",
Work in Progress, Internet-Draft, draft-briscoe-tsvwg-l4s- Work in Progress, Internet-Draft, draft-briscoe-tsvwg-l4s-
diffserv-02, 4 November 2018, diffserv-02, 4 November 2018,
<https://datatracker.ietf.org/doc/html/draft-briscoe- <https://www.ietf.org/archive/id/draft-briscoe-tsvwg-l4s-
tsvwg-l4s-diffserv-02>. diffserv-02.txt>.
[I-D.cardwell-iccrg-bbr-congestion-control] [I-D.cardwell-iccrg-bbr-congestion-control]
Cardwell, N., Cheng, Y., Yeganeh, S. H., Swett, I., and V. Cardwell, N., Cheng, Y., Yeganeh, S. H., Swett, I., and V.
Jacobson, "BBR Congestion Control", Work in Progress, Jacobson, "BBR Congestion Control", Work in Progress,
Internet-Draft, draft-cardwell-iccrg-bbr-congestion- Internet-Draft, draft-cardwell-iccrg-bbr-congestion-
control-02, 7 March 2022, control-02, 7 March 2022,
<https://datatracker.ietf.org/doc/html/draft-cardwell- <https://www.ietf.org/archive/id/draft-cardwell-iccrg-bbr-
iccrg-bbr-congestion-control-02>. congestion-control-02.txt>.
[I-D.ietf-tcpm-accurate-ecn] [I-D.ietf-tcpm-accurate-ecn]
Briscoe, B., Kühlewind, M., and R. Scheffenegger, "More Briscoe, B., Kühlewind, M., and R. Scheffenegger, "More
Accurate ECN Feedback in TCP", Work in Progress, Internet- Accurate ECN Feedback in TCP", Work in Progress, Internet-
Draft, draft-ietf-tcpm-accurate-ecn-20, 25 July 2022, Draft, draft-ietf-tcpm-accurate-ecn-20, 25 July 2022,
<https://datatracker.ietf.org/doc/html/draft-ietf-tcpm- <https://www.ietf.org/archive/id/draft-ietf-tcpm-accurate-
accurate-ecn-20>. ecn-20.txt>.
[I-D.ietf-tsvwg-aqm-dualq-coupled] [I-D.ietf-tsvwg-aqm-dualq-coupled]
Schepper, K. D., Briscoe, B., and G. White, "DualQ Coupled Schepper, K. D., Briscoe, B., and G. White, "DualQ Coupled
AQMs for Low Latency, Low Loss and Scalable Throughput AQMs for Low Latency, Low Loss and Scalable Throughput
(L4S)", Work in Progress, Internet-Draft, draft-ietf- (L4S)", Work in Progress, Internet-Draft, draft-ietf-
tsvwg-aqm-dualq-coupled-24, 7 July 2022, tsvwg-aqm-dualq-coupled-24, 7 July 2022,
<https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg- <https://www.ietf.org/archive/id/draft-ietf-tsvwg-aqm-
aqm-dualq-coupled-24>. dualq-coupled-24.txt>.
[I-D.ietf-tsvwg-ecn-encap-guidelines] [I-D.ietf-tsvwg-ecn-encap-guidelines]
Briscoe, B. and J. Kaippallimalil, "Guidelines for Adding Briscoe, B. and J. Kaippallimalil, "Guidelines for Adding
Congestion Notification to Protocols that Encapsulate IP", Congestion Notification to Protocols that Encapsulate IP",
Work in Progress, Internet-Draft, draft-ietf-tsvwg-ecn- Work in Progress, Internet-Draft, draft-ietf-tsvwg-ecn-
encap-guidelines-17, 11 July 2022, encap-guidelines-17, 11 July 2022,
<https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg- <https://www.ietf.org/archive/id/draft-ietf-tsvwg-ecn-
ecn-encap-guidelines-17>. encap-guidelines-17.txt>.
[I-D.ietf-tsvwg-ecn-l4s-id] [I-D.ietf-tsvwg-ecn-l4s-id]
Schepper, K. D. and B. Briscoe, "Explicit Congestion Schepper, K. D. and B. Briscoe, "Explicit Congestion
Notification (ECN) Protocol for Very Low Queuing Delay Notification (ECN) Protocol for Very Low Queuing Delay
(L4S)", Work in Progress, Internet-Draft, draft-ietf- (L4S)", Work in Progress, Internet-Draft, draft-ietf-
tsvwg-ecn-l4s-id-26, 7 July 2022, tsvwg-ecn-l4s-id-28, 8 August 2022,
<https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg- <https://www.ietf.org/archive/id/draft-ietf-tsvwg-ecn-l4s-
ecn-l4s-id-26>. id-28.txt>.
[I-D.ietf-tsvwg-l4sops] [I-D.ietf-tsvwg-l4sops]
White, G., "Operational Guidance for Deployment of L4S in White, G., "Operational Guidance for Deployment of L4S in
the Internet", Work in Progress, Internet-Draft, draft- the Internet", Work in Progress, Internet-Draft, draft-
ietf-tsvwg-l4sops-03, 28 April 2022, ietf-tsvwg-l4sops-03, 28 April 2022,
<https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg- <https://www.ietf.org/archive/id/draft-ietf-tsvwg-l4sops-
l4sops-03>. 03.txt>.
[I-D.ietf-tsvwg-nqb] [I-D.ietf-tsvwg-nqb]
White, G. and T. Fossati, "A Non-Queue-Building Per-Hop White, G. and T. Fossati, "A Non-Queue-Building Per-Hop
Behavior (NQB PHB) for Differentiated Services", Work in Behavior (NQB PHB) for Differentiated Services", Work in
Progress, Internet-Draft, draft-ietf-tsvwg-nqb-10, 4 March Progress, Internet-Draft, draft-ietf-tsvwg-nqb-10, 4 March
2022, <https://datatracker.ietf.org/doc/html/draft-ietf- 2022, <https://www.ietf.org/archive/id/draft-ietf-tsvwg-
tsvwg-nqb-10>. nqb-10.txt>.
[I-D.ietf-tsvwg-rfc6040update-shim] [I-D.ietf-tsvwg-rfc6040update-shim]
Briscoe, B., "Propagating Explicit Congestion Notification Briscoe, B., "Propagating Explicit Congestion Notification
Across IP Tunnel Headers Separated by a Shim", Work in Across IP Tunnel Headers Separated by a Shim", Work in
Progress, Internet-Draft, draft-ietf-tsvwg-rfc6040update- Progress, Internet-Draft, draft-ietf-tsvwg-rfc6040update-
shim-15, 11 July 2022, shim-15, 11 July 2022, <https://www.ietf.org/archive/id/
<https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg- draft-ietf-tsvwg-rfc6040update-shim-15.txt>.
rfc6040update-shim-15>.
[I-D.morton-tsvwg-codel-approx-fair] [I-D.morton-tsvwg-codel-approx-fair]
Morton, J. and P. G. Heist, "Controlled Delay Approximate Morton, J. and P. G. Heist, "Controlled Delay Approximate
Fairness AQM", Work in Progress, Internet-Draft, draft- Fairness AQM", Work in Progress, Internet-Draft, draft-
morton-tsvwg-codel-approx-fair-01, 9 March 2020, morton-tsvwg-codel-approx-fair-01, 9 March 2020,
<https://datatracker.ietf.org/doc/html/draft-morton-tsvwg- <https://www.ietf.org/archive/id/draft-morton-tsvwg-codel-
codel-approx-fair-01>. approx-fair-01.txt>.
[I-D.sridharan-tcpm-ctcp] [I-D.sridharan-tcpm-ctcp]
Sridharan, M., Tan, K., Bansal, D., and D. Thaler, Sridharan, M., Tan, K., Bansal, D., and D. Thaler,
"Compound TCP: A New TCP Congestion Control for High-Speed "Compound TCP: A New TCP Congestion Control for High-Speed
and Long Distance Networks", Work in Progress, Internet- and Long Distance Networks", Work in Progress, Internet-
Draft, draft-sridharan-tcpm-ctcp-02, 11 November 2008, Draft, draft-sridharan-tcpm-ctcp-02, 11 November 2008,
<https://datatracker.ietf.org/doc/html/draft-sridharan- <https://www.ietf.org/archive/id/draft-sridharan-tcpm-
tcpm-ctcp-02>. ctcp-02.txt>.
[I-D.stewart-tsvwg-sctpecn] [I-D.stewart-tsvwg-sctpecn]
Stewart, R. R., Tuexen, M., and X. Dong, "ECN for Stream Stewart, R. R., Tuexen, M., and X. Dong, "ECN for Stream
Control Transmission Protocol (SCTP)", Work in Progress, Control Transmission Protocol (SCTP)", Work in Progress,
Internet-Draft, draft-stewart-tsvwg-sctpecn-05, 15 January Internet-Draft, draft-stewart-tsvwg-sctpecn-05, 15 January
2014, <https://datatracker.ietf.org/doc/html/draft- 2014, <https://www.ietf.org/archive/id/draft-stewart-
stewart-tsvwg-sctpecn-05>. tsvwg-sctpecn-05.txt>.
[L4Sdemo16] [L4Sdemo16]
Bondarenko, O., De Schepper, K., Tsang, I., and B. Bondarenko, O., De Schepper, K., Tsang, I., and B.
Briscoe, "Ultra-Low Delay for All: Live Experience, Live Briscoe, "Ultra-Low Delay for All: Live Experience, Live
Analysis", Proc. MMSYS'16 pp33:1--33:4, May 2016, Analysis", Proc. MMSYS'16 pp33:1--33:4, May 2016,
<http://dl.acm.org/citation.cfm?doid=2910017.2910633 <http://dl.acm.org/citation.cfm?doid=2910017.2910633
(videos of demos: (videos of demos:
https://riteproject.eu/dctth/#1511dispatchwg )>. https://riteproject.eu/dctth/#1511dispatchwg )>.
[LEDBAT_AQM] [LEDBAT_AQM]
skipping to change at page 40, line 37 skipping to change at page 40, line 42
McIlroy, M.D., Pinson, E. N., and B. A. Tague, "UNIX Time- McIlroy, M.D., Pinson, E. N., and B. A. Tague, "UNIX Time-
Sharing System: Foreword", The Bell System Technical Sharing System: Foreword", The Bell System Technical
Journal 57:6(1902--1903), July 1978, Journal 57:6(1902--1903), July 1978,
<https://archive.org/details/bstj57-6-1899>. <https://archive.org/details/bstj57-6-1899>.
[Nadas20] Nádas, S., Gombos, G., Fejes, F., and S. Laki, "A [Nadas20] Nádas, S., Gombos, G., Fejes, F., and S. Laki, "A
Congestion Control Independent L4S Scheduler", Proc. Congestion Control Independent L4S Scheduler", Proc.
Applied Networking Research Workshop (ANRW '20) 45--51, Applied Networking Research Workshop (ANRW '20) 45--51,
July 2020, <https://doi.org/10.1145/3404868.3406669>. July 2020, <https://doi.org/10.1145/3404868.3406669>.
[NASA04] Bailey, R.R., Trey Arthur III, J.J., and S.P. Williams,
"Latency Requirements for Head-Worn Display S/EVS
Applications", SPIE Defense and Security
Symposium LF99-1955, April 2004,
<https://ntrs.nasa.gov/api/citations/20120009198/
downloads/20120009198.pdf?attachment=true>.
[PragueLinux] [PragueLinux]
Briscoe, B., De Schepper, K., Albisser, O., Misund, J., Briscoe, B., De Schepper, K., Albisser, O., Misund, J.,
Tilmans, O., Kühlewind, M., and A.S. Ahmed, "Implementing Tilmans, O., Kühlewind, M., and A.S. Ahmed, "Implementing
the `TCP Prague' Requirements for Low Latency Low Loss the `TCP Prague' Requirements for Low Latency Low Loss
Scalable Throughput (L4S)", Proc. Linux Netdev 0x13 , Scalable Throughput (L4S)", Proc. Linux Netdev 0x13 ,
March 2019, <https://www.netdevconf.org/0x13/ March 2019, <https://www.netdevconf.org/0x13/
session.html?talk-tcp-prague-l4s>. session.html?talk-tcp-prague-l4s>.
[QDyn] Briscoe, B., "Rapid Signalling of Queue Dynamics", [QDyn] Briscoe, B., "Rapid Signalling of Queue Dynamics",
bobbriscoe.net Technical Report TR-BB-2017-001; bobbriscoe.net Technical Report TR-BB-2017-001;
arXiv:1904.07044 [cs.NI], September 2017, arXiv:1904.07044 [cs.NI], September 2017,
<https://arxiv.org/abs/1904.07044>. <https://arxiv.org/abs/1904.07044>.
[Raaen14] Raaen, K. and T-M. Grønli, "Latency thresholds for
usability in games: A survey", Norsk IKT-konferanse for
forskning og utdanning , 2014,
<http://ojs.bibsys.no/index.php/NIK/article/view/9/6>.
[Rajiullah15] [Rajiullah15]
Rajiullah, M., "Towards a Low Latency Internet: Rajiullah, M., "Towards a Low Latency Internet:
Understanding and Solutions", Masters Thesis; Karlstad Understanding and Solutions", Masters Thesis; Karlstad
Uni, Dept of Maths & CS 2015:41, 2015, <https://www.diva- Uni, Dept of Maths & CS 2015:41, 2015, <https://www.diva-
portal.org/smash/get/diva2:846109/FULLTEXT01.pdf>. portal.org/smash/get/diva2:846109/FULLTEXT01.pdf>.
[RFC0970] Nagle, J., "On Packet Switches With Infinite Storage", [RFC0970] Nagle, J., "On Packet Switches With Infinite Storage",
RFC 970, DOI 10.17487/RFC0970, December 1985, RFC 970, DOI 10.17487/RFC0970, December 1985,
<https://www.rfc-editor.org/info/rfc970>. <https://www.rfc-editor.org/info/rfc970>.
skipping to change at page 41, line 34 skipping to change at page 41, line 47
[RFC2884] Hadi Salim, J. and U. Ahmed, "Performance Evaluation of [RFC2884] Hadi Salim, J. and U. Ahmed, "Performance Evaluation of
Explicit Congestion Notification (ECN) in IP Networks", Explicit Congestion Notification (ECN) in IP Networks",
RFC 2884, DOI 10.17487/RFC2884, July 2000, RFC 2884, DOI 10.17487/RFC2884, July 2000,
<https://www.rfc-editor.org/info/rfc2884>. <https://www.rfc-editor.org/info/rfc2884>.
[RFC3168] Ramakrishnan, K., Floyd, S., and D. Black, "The Addition [RFC3168] Ramakrishnan, K., Floyd, S., and D. Black, "The Addition
of Explicit Congestion Notification (ECN) to IP", of Explicit Congestion Notification (ECN) to IP",
RFC 3168, DOI 10.17487/RFC3168, September 2001, RFC 3168, DOI 10.17487/RFC3168, September 2001,
<https://www.rfc-editor.org/info/rfc3168>. <https://www.rfc-editor.org/info/rfc3168>.
[RFC3246] Davie, B., Charny, A., Bennet, J.C.R., Benson, K., Le [RFC3246] Davie, B., Charny, A., Bennet, J C R., Benson, K., Le
Boudec, J.Y., Courtney, W., Davari, S., Firoiu, V., and D. Boudec, J Y., Courtney, W., Davari, S., Firoiu, V., and D.
Stiliadis, "An Expedited Forwarding PHB (Per-Hop Stiliadis, "An Expedited Forwarding PHB (Per-Hop
Behavior)", RFC 3246, DOI 10.17487/RFC3246, March 2002, Behavior)", RFC 3246, DOI 10.17487/RFC3246, March 2002,
<https://www.rfc-editor.org/info/rfc3246>. <https://www.rfc-editor.org/info/rfc3246>.
[RFC3540] Spring, N., Wetherall, D., and D. Ely, "Robust Explicit [RFC3540] Spring, N., Wetherall, D., and D. Ely, "Robust Explicit
Congestion Notification (ECN) Signaling with Nonces", Congestion Notification (ECN) Signaling with Nonces",
RFC 3540, DOI 10.17487/RFC3540, June 2003, RFC 3540, DOI 10.17487/RFC3540, June 2003,
<https://www.rfc-editor.org/info/rfc3540>. <https://www.rfc-editor.org/info/rfc3540>.
[RFC3649] Floyd, S., "HighSpeed TCP for Large Congestion Windows", [RFC3649] Floyd, S., "HighSpeed TCP for Large Congestion Windows",
 End of changes. 26 change blocks. 
63 lines changed or deleted 67 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/