<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html><head><!-- Generated by rfcdiff 1.35: rfcdiff --><!-- <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional" > --><!-- System: Linux merlot.tools.ietf.org 2.6.15-1-686-smp #2 SMP Mon Mar 6 15:34:50 UTC 2006 i686 GNU/Linux --><!-- Using awk: /usr/bin/gawk: GNU Awk 3.1.5 --><!-- Using diff: /usr/bin/diff: diff (GNU diffutils) 2.8.1 --><!-- Using wdiff: /usr/bin/wdiff: GNU wdiff 0.5 -->
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta http-equiv="Content-Style-Type" content="text/css"><title>Diff: draft-irtf-iccrg-cc-rfcs-04.txt - draft-irtf-iccrg-cc-rfcs-05.txt</title>
<style type="text/css">
body { margin: 0.4ex; margin-right: auto; }
tr { }
td { white-space: pre; font-family: monospace; vertical-align: top; font-size: 0.86em;}
th { font-size: 0.86em; }
.small { font-size: 0.6em; font-style: italic; font-family: Verdana, Helvetica, sans-serif; }
.left { background-color: #EEE; }
.right { background-color: #FFF; }
.diff { background-color: #CCF; }
.lblock { background-color: #BFB; }
.rblock { background-color: #FF8; }
.insert { background-color: #8FF; }
.delete { background-color: #ACF; }
.void { background-color: #FFB; }
.cont { background-color: #EEE; }
.linebr { background-color: #AAA; }
.lineno { color: red; background-color: #FFF; font-size: 0.7em; text-align: right; padding: 0 2px; }
.elipsis{ background-color: #AAA; }
.left .cont { background-color: #DDD; }
.right .cont { background-color: #EEE; }
.lblock .cont { background-color: #9D9; }
.rblock .cont { background-color: #DD6; }
.insert .cont { background-color: #0DD; }
.delete .cont { background-color: #8AD; }
.stats, .stats td, .stats th { background-color: #EEE; padding: 2px 0; }
</style></head><body>
<table border="0" cellpadding="0" cellspacing="0">
<tbody><tr bgcolor="orange"><th></th><th> draft-irtf-iccrg-cc-rfcs-04.txt </th><th> </th><th> draft-irtf-iccrg-cc-rfcs-05.txt </th><th></th></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">Network Working Group M. Welzl</td><td> </td><td class="right">Network Working Group M. Welzl</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">Internet-Draft University of Innsbruck</td><td> </td><td class="right">Internet-Draft University of Innsbruck</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">Intended status: Informational W. Eddy</td><td> </td><td class="right">Intended status: Informational W. Eddy</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0001"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock">Expires: <span class="delete">October 25, 2008</span> Verizon</td><td> </td><td class="rblock">Expires: <span class="insert">January 15, 2009</span> Verizon</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> <span class="delete">April 23,</span> 2008</td><td> </td><td class="rblock"> <span class="insert">July 14,</span> 2008</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Congestion Control in the RFC Series</td><td> </td><td class="right"> Congestion Control in the RFC Series</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0002"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> draft-irtf-iccrg-cc-rfcs-0<span class="delete">4</span></td><td> </td><td class="rblock"> draft-irtf-iccrg-cc-rfcs-0<span class="insert">5</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">Status of this Memo</td><td> </td><td class="right">Status of this Memo</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> By submitting this Internet-Draft, each author represents that any</td><td> </td><td class="right"> By submitting this Internet-Draft, each author represents that any</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> applicable patent or other IPR claims of which he or she is aware</td><td> </td><td class="right"> applicable patent or other IPR claims of which he or she is aware</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> have been or will be disclosed, and any of which he or she becomes</td><td> </td><td class="right"> have been or will be disclosed, and any of which he or she becomes</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> aware will be disclosed, in accordance with Section 6 of BCP 79.</td><td> </td><td class="right"> aware will be disclosed, in accordance with Section 6 of BCP 79.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Internet-Drafts are working documents of the Internet Engineering</td><td> </td><td class="right"> Internet-Drafts are working documents of the Internet Engineering</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Task Force (IETF), its areas, and its working groups. Note that</td><td> </td><td class="right"> Task Force (IETF), its areas, and its working groups. Note that</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l2"><small>skipping to change at</small><em> page 1, line 35</em></a></th><th> </th><th><a name="part-r2"><small>skipping to change at</small><em> page 1, line 35</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> and may be updated, replaced, or obsoleted by other documents at any</td><td> </td><td class="right"> and may be updated, replaced, or obsoleted by other documents at any</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> time. It is inappropriate to use Internet-Drafts as reference</td><td> </td><td class="right"> time. It is inappropriate to use Internet-Drafts as reference</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> material or to cite them other than as "work in progress."</td><td> </td><td class="right"> material or to cite them other than as "work in progress."</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> The list of current Internet-Drafts can be accessed at</td><td> </td><td class="right"> The list of current Internet-Drafts can be accessed at</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> http://www.ietf.org/ietf/1id-abstracts.txt.</td><td> </td><td class="right"> http://www.ietf.org/ietf/1id-abstracts.txt.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> The list of Internet-Draft Shadow Directories can be accessed at</td><td> </td><td class="right"> The list of Internet-Draft Shadow Directories can be accessed at</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> http://www.ietf.org/shadow.html.</td><td> </td><td class="right"> http://www.ietf.org/shadow.html.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0003"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> This Internet-Draft will expire on <span class="delete">October 25, 2008</span>.</td><td> </td><td class="rblock"> This Internet-Draft will expire on <span class="insert">January 15, 2009</span>.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">Abstract</td><td> </td><td class="right">Abstract</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> This document is an informational snapshot produced by the IRTF's</td><td> </td><td class="right"> This document is an informational snapshot produced by the IRTF's</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Internet Congestion Control Research Group (ICCRG). It provides a</td><td> </td><td class="right"> Internet Congestion Control Research Group (ICCRG). It provides a</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> survey of congestion control topics described by documents in the RFC</td><td> </td><td class="right"> survey of congestion control topics described by documents in the RFC</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> series. This does not modify or update the specifications or status</td><td> </td><td class="right"> series. This does not modify or update the specifications or status</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> fo the RFC documents that are discussed. It may be used as a</td><td> </td><td class="right"> fo the RFC documents that are discussed. It may be used as a</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> reference or starting point for the future work of the research</td><td> </td><td class="right"> reference or starting point for the future work of the research</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> group, especially in noting gaps or open issues in the current IETF</td><td> </td><td class="right"> group, especially in noting gaps or open issues in the current IETF</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l3"><small>skipping to change at</small><em> page 10, line 19</em></a></th><th> </th><th><a name="part-r3"><small>skipping to change at</small><em> page 10, line 19</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Other than a simple retransmission timeout and flow control through</td><td> </td><td class="right"> Other than a simple retransmission timeout and flow control through</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> the advertised receive window, TCP implementations based only on RFC</td><td> </td><td class="right"> the advertised receive window, TCP implementations based only on RFC</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> 793 do not contain congestion control. As several congestion</td><td> </td><td class="right"> 793 do not contain congestion control. As several congestion</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> collapse events occurred on the Internet, it was later realized that</td><td> </td><td class="right"> collapse events occurred on the Internet, it was later realized that</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control was needed. The host requirements in RFC 1122</td><td> </td><td class="right"> congestion control was needed. The host requirements in RFC 1122</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> require conforming TCP implementations to implement Jacobson's slow</td><td> </td><td class="right"> require conforming TCP implementations to implement Jacobson's slow</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> start and congestion avoidance algorithms (later specified in RFC</td><td> </td><td class="right"> start and congestion avoidance algorithms (later specified in RFC</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> 2001 and then 2581). RFC 1122 also recommends several other</td><td> </td><td class="right"> 2001 and then 2581). RFC 1122 also recommends several other</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> behaviors that influence congestion control like the Nagle algorithm,</td><td> </td><td class="right"> behaviors that influence congestion control like the Nagle algorithm,</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> delayed acknowledgements, Jacobson's RTO estimation algorithm, and</td><td> </td><td class="right"> delayed acknowledgements, Jacobson's RTO estimation algorithm, and</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0004"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> exponent<span class="delete">ai</span>l backoff of the retransmission timer.</td><td> </td><td class="rblock"> exponent<span class="insert">ia</span>l backoff of the retransmission timer.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Basic TCP congestion control is defined in RFC 2581, with many other</td><td> </td><td class="right"> Basic TCP congestion control is defined in RFC 2581, with many other</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFCs that specify ancillary modifications and enhancements. RFC 2581</td><td> </td><td class="right"> RFCs that specify ancillary modifications and enhancements. RFC 2581</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> obsoletes the first proposed standard for TCP congestion control in</td><td> </td><td class="right"> obsoletes the first proposed standard for TCP congestion control in</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 2001. These two RFCs document the mechanisms that had already</td><td> </td><td class="right"> RFC 2001. These two RFCs document the mechanisms that had already</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> been in common use by TCP implementations for many years. The reader</td><td> </td><td class="right"> been in common use by TCP implementations for many years. The reader</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> may refer to the TCP Roadmap [RFC4614] for more information on the</td><td> </td><td class="right"> may refer to the TCP Roadmap [RFC4614] for more information on the</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0005"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> <span class="delete">RFC documents</span> that specifically describe TCP congestion control, as</td><td> </td><td class="rblock"> <span class="insert">RFCs</span> that specifically describe TCP congestion control, as this</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> this material is not replicated here.</td><td> </td><td class="rblock"> material is not replicated here.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Recently, significant effort has been put into experimental TCP</td><td> </td><td class="right"> Recently, significant effort has been put into experimental TCP</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control modifications for obtaining high throughput with</td><td> </td><td class="right"> congestion control modifications for obtaining high throughput with</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> reduced startup and recovery times. RFCs have been published on some</td><td> </td><td class="right"> reduced startup and recovery times. RFCs have been published on some</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> of these modifications, including HighSpeed TCP [RFC3649], and</td><td> </td><td class="right"> of these modifications, including HighSpeed TCP [RFC3649], and</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Limited Slow-Start [RFC3742], but high rate congestion control</td><td> </td><td class="right"> Limited Slow-Start [RFC3742], but high rate congestion control</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> mechanisms are still considered an open issue in congestion control</td><td> </td><td class="right"> mechanisms are still considered an open issue in congestion control</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> research. Other schemes have been published as Internet-Drafts or</td><td> </td><td class="right"> research. Other schemes have been published as Internet-Drafts or</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> been discussed a little by the IETF, but much of the work in this</td><td> </td><td class="right"> been discussed a little by the IETF, but much of the work in this</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> area has not been adopted within the IETF yet, so the majority of</td><td> </td><td class="right"> area has not been adopted within the IETF yet, so the majority of</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l4"><small>skipping to change at</small><em> page 11, line 10</em></a></th><th> </th><th><a name="part-r4"><small>skipping to change at</small><em> page 11, line 10</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> definition of a duplicate ACK, initial congestion window and slow</td><td> </td><td class="right"> definition of a duplicate ACK, initial congestion window and slow</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> start threshold values, behavior in response to retransmission</td><td> </td><td class="right"> start threshold values, behavior in response to retransmission</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> timeouts, the use of the limited transmit mechanism, and security</td><td> </td><td class="right"> timeouts, the use of the limited transmit mechanism, and security</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> with regards to misbehaving receivers that practice ACK division.</td><td> </td><td class="right"> with regards to misbehaving receivers that practice ACK division.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">4. Challenging Link and Path Characteristics</td><td> </td><td class="right">4. Challenging Link and Path Characteristics</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Links with large and/or variable bandwith-delay products have</td><td> </td><td class="right"> Links with large and/or variable bandwith-delay products have</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> traditionally been problematic for congestion control schemes because</td><td> </td><td class="right"> traditionally been problematic for congestion control schemes because</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> they can distort the properties of the feedback loop. Links that</td><td> </td><td class="right"> they can distort the properties of the feedback loop. Links that</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0006"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> either expose a high rate of packet <span class="delete">erasures</span> to the upper layers, or</td><td> </td><td class="rblock"> either expose a high rate of packet <span class="insert">losses</span> to the upper layers, or</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> use highly-persistent <span class="delete">ARQ</span> to prevent <span class="delete">erasures</span> also cause problems</td><td> </td><td class="rblock"> use highly-persistent <span class="insert">retransmission mechanisms</span> to prevent <span class="insert">losses</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> with some of the standard congestion control mechanisms. The</td><td> </td><td class="rblock"> also cause problems with some of the standard congestion control</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> documents in this section discuss challenging link characteristics;</td><td> </td><td class="rblock"> mechanisms. The documents in this section discuss challenging link</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> many of them were written by the "Performance Implications of Link</td><td> </td><td class="rblock"> characteristics; many of them were written by the "Performance</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> Characteristics" (PILC) Working Group.</td><td> </td><td class="rblock"> Implications of Link Characteristics" (PILC) Working Group.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> While these documents often refer to specific problems with TCP, the</td><td> </td><td class="right"> While these documents often refer to specific problems with TCP, the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> link characteristics that they describe can be expected to affect</td><td> </td><td class="right"> link characteristics that they describe can be expected to affect</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> other congestion control mechanisms too. In particular, interactions</td><td> </td><td class="right"> other congestion control mechanisms too. In particular, interactions</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> between link properties and TCP congestion control will be shared by</td><td> </td><td class="right"> between link properties and TCP congestion control will be shared by</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> other protocols that use the similar congestion control behavior,</td><td> </td><td class="right"> other protocols that use the similar congestion control behavior,</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> such as SCTP [RFC2960] and DCCP with CCID 2 [RFC4341] (see</td><td> </td><td class="right"> such as SCTP [RFC2960] and DCCP with CCID 2 [RFC4341] (see</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Section 6), and should be taken into consideration by designers of</td><td> </td><td class="right"> Section 6), and should be taken into consideration by designers of</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control mechanisms which utilize the same kind of feedback</td><td> </td><td class="right"> congestion control mechanisms which utilize the same kind of feedback</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> as TCP.</td><td> </td><td class="right"> as TCP.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l5"><small>skipping to change at</small><em> page 12, line 16</em></a></th><th> </th><th><a name="part-r5"><small>skipping to change at</small><em> page 12, line 16</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> often closely related to congestion control.</td><td> </td><td class="right"> often closely related to congestion control.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> The use of PEPs has architectural implications as they sometimes</td><td> </td><td class="right"> The use of PEPs has architectural implications as they sometimes</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> violate end-to-end assumptions and can add complexity to the inner</td><td> </td><td class="right"> violate end-to-end assumptions and can add complexity to the inner</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> portions of a network. Certain types of PEPs are commonly used</td><td> </td><td class="right"> portions of a network. Certain types of PEPs are commonly used</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> today in satellite or long-distance networking because it is</td><td> </td><td class="right"> today in satellite or long-distance networking because it is</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> easier to insert a small number of PEPs near problematic links</td><td> </td><td class="right"> easier to insert a small number of PEPs near problematic links</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> than to upgrade the TCP implementations on all the end hosts that</td><td> </td><td class="right"> than to upgrade the TCP implementations on all the end hosts that</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> might use those links. One down-side is that their deployment</td><td> </td><td class="right"> might use those links. One down-side is that their deployment</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> raises some issues when introducing new or updated CC methods into</td><td> </td><td class="right"> raises some issues when introducing new or updated CC methods into</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0007"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> these deployed <span class="delete">networks.</span></td><td> </td><td class="rblock"> these deployed <span class="insert">networks, since the PEPs may be operating with</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"><span class="insert"> undocumented algorithms, making assumptions about the end-host CC</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"><span class="insert"> behavior, and/or altering packet fields that will affect the end-</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"><span class="insert"> host CC behavior.</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3150: "End-to-end Performance Implications of Slow Links" (July</td><td> </td><td class="right"> RFC 3150: "End-to-end Performance Implications of Slow Links" (July</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> 2001)</td><td> </td><td class="right"> 2001)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> This document makes performance-related recommendations for users</td><td> </td><td class="right"> This document makes performance-related recommendations for users</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> of network paths that traverse "very low bit-rate" links. It</td><td> </td><td class="right"> of network paths that traverse "very low bit-rate" links. It</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> includes a discussion of interactions between such links and TCP</td><td> </td><td class="right"> includes a discussion of interactions between such links and TCP</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control.</td><td> </td><td class="right"> congestion control.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3155: "End-to-end Performance Implications of Links with Errors"</td><td> </td><td class="right"> RFC 3155: "End-to-end Performance Implications of Links with Errors"</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> (August 2001)</td><td> </td><td class="right"> (August 2001)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Under the premise that several types of PEP have undesirable</td><td> </td><td class="right"> Under the premise that several types of PEP have undesirable</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> implications, RFC 3155 recommends end-to-end alternatives for</td><td> </td><td class="right"> implications, RFC 3155 recommends end-to-end alternatives for</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> improving TCP performance over paths with error-prone links.</td><td> </td><td class="right"> improving TCP performance over paths with error-prone links.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3366: "Advice to link designers on link Automatic Repeat reQuest</td><td> </td><td class="right"> RFC 3366: "Advice to link designers on link Automatic Repeat reQuest</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> (ARQ)" (August 2002)</td><td> </td><td class="right"> (ARQ)" (August 2002)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Link-layer ARQ techniques are a popular means to increase the</td><td> </td><td class="right"> Link-layer ARQ techniques are a popular means to increase the</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0008"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> robustness of a particular links to transmission <span class="delete">errors.</span> As this</td><td> </td><td class="rblock"> robustness of a particular links to transmission <span class="insert">errors via</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> RFC explains, ARQ techniques on a link can interact poorly with</td><td> </td><td class="rblock"><span class="insert"> retransmission and acknowledgement mechanisms.</span> As this RFC</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> TCP's end-to-end congestion control if they lead to additional</td><td> </td><td class="rblock"> explains, ARQ techniques on a link can interact poorly with TCP's</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> delay variation or reordering. This RFC gives some advice on</td><td> </td><td class="rblock"> end-to-end congestion control if they lead to additional delay</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> limiting the extent of these types of problematic interactions.</td><td> </td><td class="rblock"> variation or reordering. This RFC gives some advice on limiting</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> The proper balance between end-to-end and link-layer reliability</td><td> </td><td class="rblock"> the extent of these types of problematic interactions. The proper</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> mechanisms is still an open research issue that has been explored</td><td> </td><td class="rblock"> balance between end-to-end and link-layer reliability mechanisms</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> in many academic papers outside the IETF.</td><td> </td><td class="rblock"> is still an open research issue that has been explored in many</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"> academic papers outside the IETF.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3449: "TCP Performance Implications of Network Path Asymmetry"</td><td> </td><td class="right"> RFC 3449: "TCP Performance Implications of Network Path Asymmetry"</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> (December 2002)</td><td> </td><td class="right"> (December 2002)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> This document describes performance limitations of TCP when the</td><td> </td><td class="right"> This document describes performance limitations of TCP when the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> capacity of the ACK path is limited. Several techniques to aid</td><td> </td><td class="right"> capacity of the ACK path is limited. Several techniques to aid</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> TCP in these circumstances are recommended as Best Current</td><td> </td><td class="right"> TCP in these circumstances are recommended as Best Current</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Practices, particularly ACK congestion control and sender pacing</td><td> </td><td class="right"> Practices, particularly ACK congestion control and sender pacing</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> are relevent to other non-TCP congestion control schemes, outside</td><td> </td><td class="right"> are relevent to other non-TCP congestion control schemes, outside</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> the scope of this document. For instance, in the design of the</td><td> </td><td class="right"> the scope of this document. For instance, in the design of the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l6"><small>skipping to change at</small><em> page 21, line 8</em></a></th><th> </th><th><a name="part-r6"><small>skipping to change at</small><em> page 21, line 8</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3048 discusses the building block approach to RMT protocols</td><td> </td><td class="right"> RFC 3048 discusses the building block approach to RMT protocols</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> and mentions that several different congestion control building</td><td> </td><td class="right"> and mentions that several different congestion control building</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> blocks may be required in order to deal with different situations.</td><td> </td><td class="right"> blocks may be required in order to deal with different situations.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Some of the possible interactions between building blocks for</td><td> </td><td class="right"> Some of the possible interactions between building blocks for</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control and those for FEC, acknowledgement, and group</td><td> </td><td class="right"> congestion control and those for FEC, acknowledgement, and group</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> management are also mentioned.</td><td> </td><td class="right"> management are also mentioned.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3208: "PGM Reliable Transport Protocol Specification" (December</td><td> </td><td class="right"> RFC 3208: "PGM Reliable Transport Protocol Specification" (December</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> 2001)</td><td> </td><td class="right"> 2001)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0009"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> As discussed in RFC 3208's Appendix B, a PGM protocol source can</td><td> </td><td class="rblock"> <span class="insert">Pragmatic General Multicast (PGM) is a reliable multicast</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> request congestion control feedback from both network elements</td><td> </td><td class="rblock"><span class="insert"> transport protocol for applications that require ordered or</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> (routers) and receivers (end hosts). These reports can indicate</td><td> </td><td class="rblock"><span class="insert"> unordered, duplicate-free, multicast data delivery from multiple</span></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> the load on the worst link in a particular path, or the load on</td><td> </td><td class="rblock"><span class="insert"> sources to multiple receivers.</span> As discussed in RFC 3208's</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> the worst path. The actual proceedure used in response to this</td><td> </td><td class="rblock"> Appendix B, a PGM protocol source can request congestion control</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> feedback is not part of RFC 3208, but the notion of using</td><td> </td><td class="rblock"> feedback from both network elements (routers) and receivers (end</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> multicast routers to assist in congestion control is significant.</td><td> </td><td class="rblock"> hosts). These reports can indicate the load on the worst link in</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"> a particular path, or the load on the worst path. The actual</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"> proceedure used in response to this feedback is not part of RFC</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"> 3208, but the notion of using multicast routers to assist in</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"></td><td> </td><td class="rblock"> congestion control is significant.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 3450: "Asynchronous Layered Coding (ALC) Protocol Instantiation"</td><td> </td><td class="right"> RFC 3450: "Asynchronous Layered Coding (ALC) Protocol Instantiation"</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> (December 2002)</td><td> </td><td class="right"> (December 2002)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> This document specifies ALC, a rough header format using the RMT</td><td> </td><td class="right"> This document specifies ALC, a rough header format using the RMT</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> building blocks, that can be used by multicast content</td><td> </td><td class="right"> building blocks, that can be used by multicast content</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> dissemination protocols. ALC is intended to use a multi-rate</td><td> </td><td class="right"> dissemination protocols. ALC is intended to use a multi-rate</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control building block, where the sender does not</td><td> </td><td class="right"> congestion control building block, where the sender does not</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> require any feedback, but where multiple multicast groups with</td><td> </td><td class="right"> require any feedback, but where multiple multicast groups with</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> different transmission rates are available within and ALC session,</td><td> </td><td class="right"> different transmission rates are available within and ALC session,</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno"></td></tr>
<tr bgcolor="gray"><td></td><th><a name="part-l7"><small>skipping to change at</small><em> page 23, line 9</em></a></th><th> </th><th><a name="part-r7"><small>skipping to change at</small><em> page 23, line 9</em></a></th><td></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> control mechanism, where the received rate for the entire</td><td> </td><td class="right"> control mechanism, where the received rate for the entire</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> multicast group is determined by the worst-connected receiver.</td><td> </td><td class="right"> multicast group is determined by the worst-connected receiver.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> TFMCC builds upon TFRC, but scales down the feedback to prevent</td><td> </td><td class="right"> TFMCC builds upon TFRC, but scales down the feedback to prevent</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> ACK-implosion effects by having receivers supress their feedback</td><td> </td><td class="right"> ACK-implosion effects by having receivers supress their feedback</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> unless they perceive it to be the worst among the reception group.</td><td> </td><td class="right"> unless they perceive it to be the worst among the reception group.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left">8. Guidance for Developing and Analyzing Congestion Control Techniques</td><td> </td><td class="right">8. Guidance for Developing and Analyzing Congestion Control Techniques</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Some recently published RFCs discuss the properties of congestion</td><td> </td><td class="right"> Some recently published RFCs discuss the properties of congestion</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> control protocols that are "safe" for Internet deployment, as well as</td><td> </td><td class="right"> control protocols that are "safe" for Internet deployment, as well as</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0010"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> how to measure the pr<span class="delete">e</span>operties of congestion control mechanisms and</td><td> </td><td class="rblock"> how to measure the properties of congestion control mechanisms and</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> transport protocols. These documents are particularly relevant to</td><td> </td><td class="right"> transport protocols. These documents are particularly relevant to</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> the ICCRG as some of the group's activities involve reviewing</td><td> </td><td class="right"> the ICCRG as some of the group's activities involve reviewing</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> congestion control proposals that have been brought to the IETF for</td><td> </td><td class="right"> congestion control proposals that have been brought to the IETF for</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> publication (see</td><td> </td><td class="right"> publication (see</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> http://www.ietf.org/IESG/content/ions/ion-tsv-alt-cc.txt).</td><td> </td><td class="right"> http://www.ietf.org/IESG/content/ions/ion-tsv-alt-cc.txt).</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 5033: "Specifying New Congestion Control Algorithms" (August</td><td> </td><td class="right"> RFC 5033: "Specifying New Congestion Control Algorithms" (August</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> 2007)</td><td> </td><td class="right"> 2007)</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> The concurrent development of multiple TCP modifications for high-</td><td> </td><td class="right"> The concurrent development of multiple TCP modifications for high-</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> rate use and the deployments of these modifications on the</td><td> </td><td class="right"> rate use and the deployments of these modifications on the</td><td class="lineno" valign="top"></td></tr>
<tr><td><a name="diff0011"></a></td></tr>
<tr><td class="lineno" valign="top"></td><td class="lblock"> Internet prompted RFC 50<span class="delete">53 to be written. RFC 505</span>3 comes from the</td><td> </td><td class="rblock"> Internet prompted RFC 50<span class="insert">33 to be written. RFC 503</span>3 comes from the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Transport Area Working Group (TSVWG), and gives guidance on the</td><td> </td><td class="right"> Transport Area Working Group (TSVWG), and gives guidance on the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> classes of Experimental RFC that can be published to document</td><td> </td><td class="right"> classes of Experimental RFC that can be published to document</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> algorithms that are either encouraged for investigation on the</td><td> </td><td class="right"> algorithms that are either encouraged for investigation on the</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Internet, and those that are only encouraged for experimentation</td><td> </td><td class="right"> Internet, and those that are only encouraged for experimentation</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> in less-critical environments. It has been described as a list of</td><td> </td><td class="right"> in less-critical environments. It has been described as a list of</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> things for people to think about when creating new congestion</td><td> </td><td class="right"> things for people to think about when creating new congestion</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> control techniques that they are planning to widely deploy.</td><td> </td><td class="right"> control techniques that they are planning to widely deploy.</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"></td><td> </td><td class="right"></td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> RFC 5166: "Metrics for the Evaluation of Congestion Control</td><td> </td><td class="right"> RFC 5166: "Metrics for the Evaluation of Congestion Control</td><td class="lineno" valign="top"></td></tr>
<tr><td class="lineno" valign="top"></td><td class="left"> Mechanisms" (March 2008)</td><td> </td><td class="right"> Mechanisms" (March 2008)</td><td class="lineno" valign="top"></td></tr>
<tr><td></td><td class="left"></td><td> </td><td class="right"></td><td></td></tr>
<tr bgcolor="gray"><th colspan="5" align="center"><a name="end"> End of changes. 11 change blocks. </a></th></tr>
<tr class="stats"><td></td><th><i>31 lines changed or deleted</i></th><th><i> </i></th><th><i>39 lines changed or added</i></th><td></td></tr>
<tr><td colspan="5" class="small" align="center"><br>This html diff was produced by rfcdiff 1.35. The latest version is available from <a href="http://www.tools.ietf.org/tools/rfcdiff/">http://tools.ietf.org/tools/rfcdiff/</a> </td></tr>
</tbody></table>
</body></html>