<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.6.22 (Ruby 3.0.5) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-scheffenegger-congress-rfc5033bis-00" category="bcp" consensus="true" submissionType="IETF" obsoletes="5033" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.16.0 -->
  <front>
    <title abbrev="New CC Algorithms">Specifying New Congestion Control Algorithms</title>
    <seriesInfo name="Internet-Draft" value="draft-scheffenegger-congress-rfc5033bis-00"/>
    <author initials="R." surname="Scheffenegger" fullname="Richard Scheffenegger" role="editor">
      <organization>NetApp, Inc.</organization>
      <address>
        <email>srichard@netapp.com</email>
      </address>
    </author>
    <author initials="S." surname="Floyd" fullname="Sally Floyd">
      <organization abbrev="ICIR / ICSI">ICSI Center for Internet Research</organization>
      <address>
        <email>floyd@icir.org</email>
        <uri>http://www.icir.org/floyd</uri>
      </address>
    </author>
    <author initials="M." surname="Allman" fullname="Mark Allman">
      <organization abbrev="ICIR / ICSI">ICSI Center for Internet Research</organization>
      <address>
        <email>mallman@icir.org</email>
        <uri>http://www.icir.org/mallman</uri>
      </address>
    </author>
    <date year="2023" month="February" day="17"/>
    <area>General</area>
    <workgroup>TODO Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <t>The IETF's standard congestion control schemes have been widely shown
to be inadequate for various environments (e.g., high-speed
networks).
Recent research has yielded many alternate congestion
control schemes that significantly differ from the IETF's congestion
control principles.
Using these new congestion control schemes in
the global Internet has possible ramifications to both the traffic
using the new congestion control and to traffic using the currently
standardized congestion control.
Therefore, the IETF must proceed
with caution when dealing with alternate congestion control
proposals.
The goal of this document is to provide guidance for
considering alternate congestion control algorithms within the IETF.</t>
    </abstract>
    <note removeInRFC="true">
      <name>Discussion Venues</name>
      <t>Source for this draft and an issue tracker can be found at
    <eref target="https://github.com/rscheff/drafts"/>.</t>
    </note>
  </front>
  <middle>
    <section anchor="introduction">
      <name>Introduction</name>
      <t>This document provides guidelines for the IETF to use when evaluating
suggested congestion control algorithms that significantly differ
from the general congestion control principles outlined in <xref target="RFC2914"/>.
The guidance is intended to be useful to authors proposing alternate
congestion control and for the IETF community when evaluating whether
a proposal is appropriate for publication in the RFC series.</t>
      <t>The guidelines in this document are intended to be consistent with
the congestion control principles from <xref target="RFC2914"/> of preventing
congestion collapse, considering fairness, and optimizing the flow's
own performance in terms of throughput, delay, and loss.
<xref target="RFC2914"/>
also discusses the goal of avoiding a congestion control "arms race"
among competing transport protocols.</t>
      <t>This document does not give hard-and-fast requirements for an
appropriate congestion control scheme.
Rather, the document provides
a set of criteria that should be considered and weighed by the IETF
in the context of each proposal.
The high-order criteria for any new
proposal is that a serious scientific study of the pros and cons of
the proposal needs to have been done such that the IETF has a well-
rounded set of information to consider.</t>
      <t>After initial studies, we encourage authors to write a specification
of their proposals for publication in the RFC series to allow others
to concretely understand and investigate the wealth of proposals in
this space.</t>
    </section>
    <section anchor="document-status">
      <name>Document Status</name>
      <t>Following the lead of HighSpeed TCP <xref target="RFC3649"/>, alternate congestion
control algorithms are expected to be published as "Experimental"
RFCs until such time that the community better understands the
solution space.
Traditionally, the meaning of "Experimental" status
has varied in its use and interpretation.
As part of this document
we define two classes of congestion control proposals that can be
published with the "Experimental" status.
The first class includes
algorithms that are judged to be safe to deploy for best-effort
traffic in the global Internet and further investigated in that
environment.
The second class includes algorithms that, while
promising, are not deemed safe enough for widespread deployment as
best-effort traffic on the Internet, but are being specified to
facilitate investigations in simulation, testbeds, or controlled
environments.
The second class can also include algorithms where the
IETF does not yet have sufficient understanding to decide if the
algorithm is or is not safe for deployment on the Internet.</t>
      <t>Each alternate congestion control algorithm published is required to
include a statement in the abstract indicating whether or not the
proposal is considered safe for use on the Internet.
Each alternate
congestion control algorithm published is also required to include a
statement in the abstract describing environments where the protocol
is not recommended for deployment.
There may be environments where
the protocol is deemed <em>safe</em> for use, but still is not <em>recommended</em>
for use because it does not perform well for the user.</t>
      <t>As examples of such statements, <xref target="RFC3649"/> specifying HighSpeed TCP
includes a statement in the abstract stating that the proposal is
Experimental, but may be deployed in the current Internet.  In
contrast, the Quick-Start document <xref target="RFC4782"/> includes a paragraph in
the abstract stating the mechanism is only being proposed for
controlled environments.  The abstract specifies environments where
the Quick-Start request could give false positives (and therefore
would be unsafe to deploy).  The abstract also specifies environments
where packets containing the Quick-Start request could be dropped in
the network; in such an environment, Quick-Start would not be unsafe
to deploy, but deployment would still not be recommended because it
could cause unnecessary delays for the connections attempting to use
Quick-Start.</t>
      <t>For authors of alternate congestion control schemes who are not ready
to bring their congestion control mechanisms to the IETF for
standardization (either as Experimental or as Proposed Standard), one
possibility would be to submit an internet-draft that documents the
alternate congestion control mechanism for the benefit of the IETF
and IRTF communities.  This is particularly encouraged in order to
get algorithm specifications widely disseminated to facilitate
further research.  Such an internet-draft could be submitted to be
considered as an Informational RFC, as a first step in the process
towards standardization.  Such a document would also be expected to
carry an explicit warning against using the scheme in the global
Internet.</t>
      <t>Note: we are not changing the RFC publication process for non-IETF
produced documents (e.g., those from the IRTF or Independent
Submissions via the RFC-Editor).  However, we would hope the
guidelines in this document inform the IESG as they consider whether
to add a note to such documents.</t>
    </section>
    <section anchor="guidelines">
      <name>Guidelines</name>
      <t>As noted above, authors are expected to do a well-rounded evaluation
of the pros and cons of proposals brought to the IETF.  The following
are guidelines to help authors and the IETF community.  Concerns that
fall outside the scope of these guidelines are certainly possible;
these guidelines should not be considered as an all-encompassing
check-list.</t>
      <dl>
        <dt>(0)</dt>
        <dd>
          <t>Differences with Congestion Control Principles <xref target="RFC2914"/></t>
        </dd>
        <dt/>
        <dd>
          <t>Proposed congestion control mechanisms should include a clear
explanation of the deviations from <xref target="RFC2914"/>.</t>
        </dd>
        <dt>(1)</dt>
        <dd>
          <t>Impact on Standard TCP, SCTP <xref target="RFC2960"/>, and DCCP <xref target="RFC4340"/>.</t>
        </dd>
        <dt/>
        <dd>
          <t>Proposed congestion control mechanisms should be evaluated when
competing with standard IETF congestion control <xref target="RFC2581"/>,
<xref target="RFC2960"/>, <xref target="RFC4340"/>.  Alternate congestion controllers that have a
significantly negative impact on traffic using standard
congestion control may be suspect and this aspect should be part
of the community's decision making with regards to the
suitability of the alternate congestion control mechanism.</t>
        </dd>
        <dt/>
        <dd>
          <t>We note that this bullet is not a requirement for strict TCP-
friendliness as a prerequisite for an alternate congestion
control mechanism to advance to Experimental.  As an example,
HighSpeed TCP is a congestion control mechanism that is
Experimental, but that is not TCP-friendly in all environments.
We also note that this guideline does not constrain the fairness
offered for non-best-effort traffic.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, fairness with standard
TCP is discussed in Sections 4 and 6 of <xref target="RFC3649"/> (HighSpeed TCP)
and using spare capacity is discussed in Sections 6, 11.1, and 12
of <xref target="RFC3649"/>.</t>
        </dd>
        <dt>(2)</dt>
        <dd>
          <t>Difficult Environments.</t>
        </dd>
        <dt/>
        <dd>
          <t>The proposed algorithms should be assessed in difficult
environments such as paths containing wireless links.
Characteristics of wireless environments are discussed in
<xref target="RFC3819"/> and in Section 16 of <xref target="Tools"/>.  Other difficult
environments can include those with multipath routing within a
connection.  We note that there is still much to be desired in
terms of the performance of TCP in some of these difficult
environments.  For congestion control mechanisms with explicit
feedback from routers, difficult environments can include paths
with non-IP queues at layer-two, IP tunnels, and the like.  A
minimum goal for experimental mechanisms proposed for widespread
deployment in the Internet should be that they do not perform
significantly worse than TCP in these environments.</t>
        </dd>
        <dt/>
        <dd>
          <t>While it is impossible to enumerate all the possible "difficult
environments", we note that the IETF has previously grappled with
paths with long delays <xref target="RFC2488"/>, high delay bandwidth products
<xref target="RFC3649"/>, high packet corruption rates <xref target="RFC3155"/>, packet
reordering <xref target="RFC4653"/>, and significantly slow links <xref target="RFC3150"/>.
Aspects of alternate congestion control that impact networks with
these characteristics should be detailed.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, performance in difficult
environments is discussed in Sections 6, 9.2, and 10.2 of
<xref target="RFC4782"/> (Quick-Start).</t>
        </dd>
        <dt>(3)</dt>
        <dd>
          <t>Investigating a Range of Environments.</t>
        </dd>
        <dt/>
        <dd>
          <t>Similar to the last criteria, proposed alternate congestion
controllers should be assessed in a range of environments.  For
instance, proposals should be investigated across a range of
bandwidths, round-trip times, levels of traffic on the reverse
path, and levels of statistical multiplexing at the congested
link.  Similarly, proposals should be investigated for robust
performance with different queueing mechanisms in the routers,
especially Random Early Detection (RED) <xref target="FJ03"/> and Drop-Tail.
This evaluation is often not included in the internet-draft
itself, but in related papers cited in the draft.</t>
        </dd>
        <dt/>
        <dd>
          <t>A particularly important aspect of evaluating a proposal for
standardization is in understanding where the algorithm breaks
down.  Therefore, particular attention should be paid to
characterizing the areas where the proposed mechanism does not
perform well.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, performance in a range of
environments is discussed in Section 12 of <xref target="RFC3649"/> (HighSpeed
TCP) and Section 9.7 of <xref target="RFC4782"/> (Quick-Start).</t>
        </dd>
        <dt>(4)</dt>
        <dd>
          <t>Protection Against Congestion Collaps</t>
        </dd>
        <dt/>
        <dd>
          <t>The alternate congestion control mechanism should either stop
sending when the packet drop rate exceeds some threshold
<xref target="RFC3714"/>, or should include some notion of "full backoff".  For
"full backoff", at some point the algorithm would reduce the
sending rate to one packet per round-trip time and then
exponentially backoff the time between single packet
transmissions if congestion persists.  Exactly when either "full
backoff" or a pause in sending comes into play will be
algorithm-specific.  However, as discussed in <xref target="RFC2914"/>, this
requirement is crucial to protect the network in times of extreme
congestion.</t>
        </dd>
        <dt/>
        <dd>
          <t>If "full backoff" is used, this bullet does not require that the
full backoff mechanism must be identical to that of TCP
<xref target="RFC2988"/>.  As an example, this bullet does not preclude full
backoff mechanisms that would give flows with different round-
trip times comparable bandwidth during backoff.</t>
        </dd>
        <dt>(5)</dt>
        <dd>
          <t>Fairness within the Alternate Congestion Control Algorithm.</t>
        </dd>
        <dt/>
        <dd>
          <t>In environments with multiple competing flows all using the same
alternate congestion control algorithm, the proposal should
explore how bandwidth is shared among the competing flows.</t>
        </dd>
        <dt>(6)</dt>
        <dd>
          <t>Performance with Misbehaving Nodes and Outside Attackers.</t>
        </dd>
        <dt/>
        <dd>
          <t>The proposal should explore how the alternate congestion control
mechanism performs with misbehaving senders, receivers, or
routers.  In addition, the proposal should explore how the
alternate congestion control mechanism performs with outside
attackers.  This can be particularly important for congestion
control mechanisms that involve explicit feedback from routers
along the path.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, performance with
misbehaving nodes and outside attackers is discussed in Sections
9.4, 9.5, and 9.6 of <xref target="RFC4782"/> (Quick-Start).  This includes
discussion of misbehaving senders and receivers; collusion
between misbehaving routers; misbehaving middleboxes; and the
potential use of Quick-Start to attack routers or to tie up
available Quick-Start bandwidth.</t>
        </dd>
        <dt>(7)</dt>
        <dd>
          <t>Responses to Sudden or Transient Events.</t>
        </dd>
        <dt/>
        <dd>
          <t>The proposal should consider how the alternate congestion control
mechanism would perform in the presence of transient events such
as sudden congestion, a routing change, or a mobility event.
Routing changes, link disconnections, intermittent link
connectivity, and mobility are discussed in more detail in
Section 17 of <xref target="Tools"/>.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, response to transient
events is discussed in Section 9.2 of <xref target="RFC4782"/> (Quick-Start).</t>
        </dd>
        <dt>(8)</dt>
        <dd>
          <t>Incremental Deployment.</t>
        </dd>
        <dt/>
        <dd>
          <t>The proposal should discuss whether the alternate congestion
control mechanism allows for incremental deployment in the
targeted environment.  For a mechanism targeted for deployment in
the current Internet, it would be helpful for the proposal to
discuss what is known (if anything) about the correct operation
of the mechanism with some of the equipment installed in the
current Internet, e.g., routers, transparent proxies, WAN
optimizers, intrusion detection systems, home routers, and the
like.</t>
        </dd>
        <dt/>
        <dd>
          <t>As a similar concern, if the alternate congestion control
mechanism is intended only for specific environments (and not the
global Internet), the proposal should consider how this intention
is to be carried out.  The community will have to address the
question of whether the scope can be enforced by simply stating
the restrictions or whether additional protocol mechanisms are
required to enforce the scoping.  The answer will necessarily
depend on the change being proposed.</t>
        </dd>
        <dt/>
        <dd>
          <t>As an example from an Experimental RFC, deployment issues are
discussed in Sections 10.3 and 10.4 of <xref target="RFC4782"/> (Quick-Start).</t>
        </dd>
      </dl>
    </section>
    <section anchor="minimum-requirements">
      <name>Minimum Requirements</name>
      <t>This section suggests minimum requirements for a document to be
approved as Experimental with approval for widespread deployment in
the global Internet.</t>
      <t>The minimum requirements for approval for widespread deployment in
the global Internet include the following guidelines on: (1)
assessing the impact on standard congestion control, (3)
investigation of the proposed mechanism in a range of environments,
(4) protection against congestion collapse, and (8) discussing
whether the mechanism allows for incremental deployment.</t>
      <t>For other guidelines, i.e., (2), (5), (6), and (7), the author must
perform the suggested evaluations and provide recommended analysis.
Evidence that the proposed mechanism has significantly more problems
than those of TCP should be a cause for concern in approval for
widespread deployment in the global Internet.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document does not represent a change to any aspect of the TCP/IP
protocol suite and therefore does not directly impact Internet
security.  The implementation of various facets of the Internet's
current congestion control algorithms do have security implications
(e.g., as outlined in <xref target="RFC2581"/>).  Alternate congestion control
schemes should be mindful of such pitfalls, as well, and should
examine any potential security issues that may arise.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        <reference anchor="RFC2914">
          <front>
            <title>Congestion Control Principles</title>
            <author fullname="S. Floyd" initials="S." surname="Floyd">
              <organization/>
            </author>
            <date month="September" year="2000"/>
            <abstract>
              <t>The goal of this document is to explain the need for congestion control in the Internet, and to discuss what constitutes correct congestion control.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="41"/>
          <seriesInfo name="RFC" value="2914"/>
          <seriesInfo name="DOI" value="10.17487/RFC2914"/>
        </reference>
        <reference anchor="RFC2960">
          <front>
            <title>Stream Control Transmission Protocol</title>
            <author fullname="R. Stewart" initials="R." surname="Stewart">
              <organization/>
            </author>
            <author fullname="Q. Xie" initials="Q." surname="Xie">
              <organization/>
            </author>
            <author fullname="K. Morneault" initials="K." surname="Morneault">
              <organization/>
            </author>
            <author fullname="C. Sharp" initials="C." surname="Sharp">
              <organization/>
            </author>
            <author fullname="H. Schwarzbauer" initials="H." surname="Schwarzbauer">
              <organization/>
            </author>
            <author fullname="T. Taylor" initials="T." surname="Taylor">
              <organization/>
            </author>
            <author fullname="I. Rytina" initials="I." surname="Rytina">
              <organization/>
            </author>
            <author fullname="M. Kalla" initials="M." surname="Kalla">
              <organization/>
            </author>
            <author fullname="L. Zhang" initials="L." surname="Zhang">
              <organization/>
            </author>
            <author fullname="V. Paxson" initials="V." surname="Paxson">
              <organization/>
            </author>
            <date month="October" year="2000"/>
            <abstract>
              <t>This document describes the Stream Control Transmission Protocol (SCTP). [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2960"/>
          <seriesInfo name="DOI" value="10.17487/RFC2960"/>
        </reference>
        <reference anchor="RFC4340">
          <front>
            <title>Datagram Congestion Control Protocol (DCCP)</title>
            <author fullname="E. Kohler" initials="E." surname="Kohler">
              <organization/>
            </author>
            <author fullname="M. Handley" initials="M." surname="Handley">
              <organization/>
            </author>
            <author fullname="S. Floyd" initials="S." surname="Floyd">
              <organization/>
            </author>
            <date month="March" year="2006"/>
            <abstract>
              <t>The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams.  DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4340"/>
          <seriesInfo name="DOI" value="10.17487/RFC4340"/>
        </reference>
        <reference anchor="RFC2581">
          <front>
            <title>TCP Congestion Control</title>
            <author fullname="M. Allman" initials="M." surname="Allman">
              <organization/>
            </author>
            <author fullname="V. Paxson" initials="V." surname="Paxson">
              <organization/>
            </author>
            <author fullname="W. Stevens" initials="W." surname="Stevens">
              <organization/>
            </author>
            <date month="April" year="1999"/>
            <abstract>
              <t>This document defines TCP's four intertwined congestion control algorithms: slow start, congestion avoidance, fast retransmit, and fast recovery.  In addition, the document specifies how TCP should begin transmission after a relatively long idle period, as well as discussing various acknowledgment generation methods.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2581"/>
          <seriesInfo name="DOI" value="10.17487/RFC2581"/>
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="FJ03">
          <front>
            <title>Random Early Detection Gateways for Congestion Avoidance</title>
            <author initials="S." surname="Floyd">
              <organization/>
            </author>
            <author initials="V." surname="Jacobson">
              <organization/>
            </author>
            <date year="1993" month="August"/>
          </front>
          <seriesInfo name="IEEE/ACM Transactions on Networking, V.1 N.4" value=""/>
        </reference>
        <reference anchor="Metrics">
          <front>
            <title>Metrics for the Evaluation of Congestion Control Mechanisms</title>
            <author initials="S." surname="Floyd">
              <organization/>
            </author>
            <date year="2007" month="July"/>
          </front>
          <seriesInfo name="Work in Progress" value=""/>
        </reference>
        <reference anchor="Tools">
          <front>
            <title>Tools for the Evaluation of Simulation and Testbed Scenarios</title>
            <author initials="S." surname="Floyd">
              <organization/>
            </author>
            <author initials="E." surname="Kohler">
              <organization/>
            </author>
            <date year="2007" month="July"/>
          </front>
          <seriesInfo name="Work in Progress" value=""/>
        </reference>
        <reference anchor="RFC3649">
          <front>
            <title>HighSpeed TCP for Large Congestion Windows</title>
            <author fullname="S. Floyd" initials="S." surname="Floyd">
              <organization/>
            </author>
            <date month="December" year="2003"/>
            <abstract>
              <t>The proposals in this document are experimental.  While they may be deployed in the current Internet, they do not represent a consensus that this is the best method for high-speed congestion control.  In particular, we note that alternative experimental proposals are likely to be forthcoming, and it is not well understood how the proposals in this document will interact with such alternative proposals.  This document proposes HighSpeed TCP, a modification to TCP's congestion control mechanism for use with TCP connections with large congestion windows.  The congestion control mechanisms of the current Standard TCP constrains the congestion windows that can be achieved by TCP in realistic environments.  For example, for a Standard TCP connection with 1500-byte packets and a 100 ms round-trip time, achieving a steady-state throughput of 10 Gbps would require an average congestion window of 83,333 segments, and a packet drop rate of at most one congestion event every 5,000,000,000 packets (or equivalently, at most one congestion event every 1 2/3 hours).  This is widely acknowledged as an unrealistic constraint.  To address his limitation of TCP, this document proposes HighSpeed TCP, and solicits experimentation and feedback from the wider community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3649"/>
          <seriesInfo name="DOI" value="10.17487/RFC3649"/>
        </reference>
        <reference anchor="RFC4782">
          <front>
            <title>Quick-Start for TCP and IP</title>
            <author fullname="S. Floyd" initials="S." surname="Floyd">
              <organization/>
            </author>
            <author fullname="M. Allman" initials="M." surname="Allman">
              <organization/>
            </author>
            <author fullname="A. Jain" initials="A." surname="Jain">
              <organization/>
            </author>
            <author fullname="P. Sarolahti" initials="P." surname="Sarolahti">
              <organization/>
            </author>
            <date month="January" year="2007"/>
            <abstract>
              <t>This document specifies an optional Quick-Start mechanism for transport protocols, in cooperation with routers, to determine an allowed sending rate at the start and, at times, in the middle of a data transfer (e.g., after an idle period).  While Quick-Start is designed to be used by a range of transport protocols, in this document we only specify its use with TCP.  Quick-Start is designed to allow connections to use higher sending rates when there is significant unused bandwidth along the path, and the sender and all of the routers along the path approve the Quick-Start Request.</t>
              <t>This document describes many paths where Quick-Start Requests would not be approved.  These paths include all paths containing routers, IP tunnels, MPLS paths, and the like that do not support Quick- Start.  These paths also include paths with routers or middleboxes that drop packets containing IP options.  Quick-Start Requests could be difficult to approve over paths that include multi-access layer- two networks.  This document also describes environments where the Quick-Start process could fail with false positives, with the sender incorrectly assuming that the Quick-Start Request had been approved by all of the routers along the path.  As a result of these concerns, and as a result of the difficulties and seeming absence of motivation for routers, such as core routers to deploy Quick-Start, Quick-Start is being proposed as a mechanism that could be of use in controlled environments, and not as a mechanism that would be intended or appropriate for ubiquitous deployment in the global Internet.  This memo defines an Experimental Protocol for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4782"/>
          <seriesInfo name="DOI" value="10.17487/RFC4782"/>
        </reference>
        <reference anchor="RFC3819">
          <front>
            <title>Advice for Internet Subnetwork Designers</title>
            <author fullname="P. Karn" initials="P." role="editor" surname="Karn">
              <organization/>
            </author>
            <author fullname="C. Bormann" initials="C." surname="Bormann">
              <organization/>
            </author>
            <author fullname="G. Fairhurst" initials="G." surname="Fairhurst">
              <organization/>
            </author>
            <author fullname="D. Grossman" initials="D." surname="Grossman">
              <organization/>
            </author>
            <author fullname="R. Ludwig" initials="R." surname="Ludwig">
              <organization/>
            </author>
            <author fullname="J. Mahdavi" initials="J." surname="Mahdavi">
              <organization/>
            </author>
            <author fullname="G. Montenegro" initials="G." surname="Montenegro">
              <organization/>
            </author>
            <author fullname="J. Touch" initials="J." surname="Touch">
              <organization/>
            </author>
            <author fullname="L. Wood" initials="L." surname="Wood">
              <organization/>
            </author>
            <date month="July" year="2004"/>
            <abstract>
              <t>This document provides advice to the designers of digital communication equipment, link-layer protocols, and packet-switched local networks (collectively referred to as subnetworks), who wish to support the Internet protocols but may be unfamiliar with the Internet architecture and the implications of their design choices on the performance and efficiency of the Internet.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="89"/>
          <seriesInfo name="RFC" value="3819"/>
          <seriesInfo name="DOI" value="10.17487/RFC3819"/>
        </reference>
        <reference anchor="RFC2488">
          <front>
            <title>Enhancing TCP Over Satellite Channels using Standard Mechanisms</title>
            <author fullname="M. Allman" initials="M." surname="Allman">
              <organization/>
            </author>
            <author fullname="D. Glover" initials="D." surname="Glover">
              <organization/>
            </author>
            <author fullname="L. Sanchez" initials="L." surname="Sanchez">
              <organization/>
            </author>
            <date month="January" year="1999"/>
            <abstract>
              <t>The Transmission Control Protocol (TCP) provides reliable delivery of data across any network path, including network paths containing satellite channels.  While TCP works over satellite channels there are several IETF standardized mechanisms that enable TCP to more effectively utilize the available capacity of the network path.  This document outlines some of these TCP mitigations.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="28"/>
          <seriesInfo name="RFC" value="2488"/>
          <seriesInfo name="DOI" value="10.17487/RFC2488"/>
        </reference>
        <reference anchor="RFC3155">
          <front>
            <title>End-to-end Performance Implications of Links with Errors</title>
            <author fullname="S. Dawkins" initials="S." surname="Dawkins">
              <organization/>
            </author>
            <author fullname="G. Montenegro" initials="G." surname="Montenegro">
              <organization/>
            </author>
            <author fullname="M. Kojo" initials="M." surname="Kojo">
              <organization/>
            </author>
            <author fullname="V. Magret" initials="V." surname="Magret">
              <organization/>
            </author>
            <author fullname="N. Vaidya" initials="N." surname="Vaidya">
              <organization/>
            </author>
            <date month="August" year="2001"/>
            <abstract>
              <t>This document discusses the specific TCP mechanisms that are problematic in environments with high uncorrected error rates, and discusses what can be done to mitigate the problems without introducing intermediate devices into the connection.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="50"/>
          <seriesInfo name="RFC" value="3155"/>
          <seriesInfo name="DOI" value="10.17487/RFC3155"/>
        </reference>
        <reference anchor="RFC4653">
          <front>
            <title>Improving the Robustness of TCP to Non-Congestion Events</title>
            <author fullname="S. Bhandarkar" initials="S." surname="Bhandarkar">
              <organization/>
            </author>
            <author fullname="A. L. N. Reddy" initials="A. L. N." surname="Reddy">
              <organization/>
            </author>
            <author fullname="M. Allman" initials="M." surname="Allman">
              <organization/>
            </author>
            <author fullname="E. Blanton" initials="E." surname="Blanton">
              <organization/>
            </author>
            <date month="August" year="2006"/>
            <abstract>
              <t>This document specifies Non-Congestion Robustness (NCR) for TCP.  In the absence of explicit congestion notification from the network, TCP uses loss as an indication of congestion.  One of the ways TCP detects loss is using the arrival of three duplicate acknowledgments. However, this heuristic is not always correct, notably in the case when network paths reorder segments (for whatever reason), resulting in degraded performance.  TCP-NCR is designed to mitigate this degraded performance by increasing the number of duplicate acknowledgments required to trigger loss recovery, based on the current state of the connection, in an effort to better disambiguate true segment loss from segment reordering.  This document specifies the changes to TCP, as well as the costs and benefits of these modifications.  This memo defines an Experimental Protocol for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4653"/>
          <seriesInfo name="DOI" value="10.17487/RFC4653"/>
        </reference>
        <reference anchor="RFC3150">
          <front>
            <title>End-to-end Performance Implications of Slow Links</title>
            <author fullname="S. Dawkins" initials="S." surname="Dawkins">
              <organization/>
            </author>
            <author fullname="G. Montenegro" initials="G." surname="Montenegro">
              <organization/>
            </author>
            <author fullname="M. Kojo" initials="M." surname="Kojo">
              <organization/>
            </author>
            <author fullname="V. Magret" initials="V." surname="Magret">
              <organization/>
            </author>
            <date month="July" year="2001"/>
            <abstract>
              <t>This document makes performance-related recommendations for users of network paths that traverse "very low bit-rate" links.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="48"/>
          <seriesInfo name="RFC" value="3150"/>
          <seriesInfo name="DOI" value="10.17487/RFC3150"/>
        </reference>
        <reference anchor="RFC3714">
          <front>
            <title>IAB Concerns Regarding Congestion Control for Voice Traffic in the Internet</title>
            <author fullname="S. Floyd" initials="S." role="editor" surname="Floyd">
              <organization/>
            </author>
            <author fullname="J. Kempf" initials="J." role="editor" surname="Kempf">
              <organization/>
            </author>
            <date month="March" year="2004"/>
            <abstract>
              <t>This document discusses IAB concerns about effective end-to-end congestion control for best-effort voice traffic in the Internet.  These concerns have to do with fairness, user quality, and with the dangers of congestion collapse.  The concerns are particularly relevant in light of the absence of a widespread Quality of Service (QoS) deployment in the Internet, and the likelihood that this situation will not change much in the near term.  This document is not making any recommendations about deployment paths for Voice over Internet Protocol (VoIP) in terms of QoS support, and is not claiming that best-effort service can be relied upon to give acceptable performance for VoIP.  We are merely observing that voice traffic is occasionally deployed as best-effort traffic over some links in the Internet, that we expect this occasional deployment to continue, and that we have concerns about the lack of effective end-to-end congestion control for this best-effort voice traffic.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3714"/>
          <seriesInfo name="DOI" value="10.17487/RFC3714"/>
        </reference>
        <reference anchor="RFC2988">
          <front>
            <title>Computing TCP's Retransmission Timer</title>
            <author fullname="V. Paxson" initials="V." surname="Paxson">
              <organization/>
            </author>
            <author fullname="M. Allman" initials="M." surname="Allman">
              <organization/>
            </author>
            <date month="November" year="2000"/>
            <abstract>
              <t>This document defines the standard algorithm that Transmission Control Protocol (TCP) senders are required to use to compute and manage their retransmission timer.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2988"/>
          <seriesInfo name="DOI" value="10.17487/RFC2988"/>
        </reference>
      </references>
    </references>
    <section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>Discussions with Lars Eggert and Aaron Falk seeded this document.
Thanks to Bob Briscoe, Gorry Fairhurst, Doug Leith, Jitendra Padhye,
Colin Perkins, Pekka Savola, members of TSVWG, and participants at
the TCP Workshop at Microsoft Research for feedback and
contributions.  This document also draws from <xref target="Metrics"/>.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA7VbW3PbRpZ+71/Rq1RtrBRJS7J8kVJbOxpJ9jg7TjySNn7Y
2ppqAk2yVyCAoAHSTMr/fb5z+oIGRUr2bI0fEhGX7tPn8p0rxuOxaE1b6HN5
cFvrzMw2ppzLn/VaXlblXNvWVCX92TZVIS+KedWYdrG0B0JNp41e4TV+9nJw
L6+yUi2xZt6oWTu22ULPZrrU87luxhnWbbS142aWvTx68WJq7PjoSGSq1Vhh
cy6nWS1s22i1PJfvr+/eimpqq0K32p5LekEIUzfnsm06254cHZ0dnQiFp8/l
O2zRqEKsq+Z+3lRdfS7vfrn6RX7CbzrVO7om7vUGD+RYu2x1U+p2fEVUCuyp
yvzvqqhKUL7RVtilatq//9ZVvHVZidqcy/9pq2wkbdWAwpnFX5sl/fG/Qqiu
XVTNuZBjIfHPlHjpZiJv09PzHcebG5MtVJPvuF81c1Wa3xXx/hyyaC/qegRy
swnf1ktlinNpG7fAn3AEVdeTrFrybQgKq+vctFUzoOV2It8W1SZPaLhVRbFJ
rg53fn95+15eamKTnFVNZJi80VarJlvwO0ER3l++v5HP+aWUzBkt/ieTmWaC
1flO14CPi7atz58/X6/Xk3Dz+cwRktD8YQLFKpaqTIj+oJr79Oq/gOil4uW/
kmz/tBBl1SxBxkqfQ0fLWfJLyrc/Hb0453W8vd1A26qlvFYNRHAF9c7Y1t7B
DtZqY5n4xAYvVpXJVZlpXsPqxmhLe5CNXF8/v7j8IO8aVVrFy1iJV6A5a6f6
I/nr5Fj+PDnll3NscS6Pz85ejN84bgTNxb/xDmXx136dyJ9URtZY0ok+6BYq
aAeH8teY+Hah5fVKFR1LRlazXZDyQUOJS2OX9sG5yGyxsfzYVAwYCe0w+9fj
10/Sjot3VVUMSeQrewi8NcuucL8gHXkHYqeaTFSXqjHVv4LG5Nr1RP5XtSiA
AmI8HkNHgYIQpxB3IJSQ8HsrGaQINrKel5nnJeHsUlu5UCstp1qXcm1yDe2y
i2pdirbCReykcv0bjqyZBys6V2elLlemqcolDMfKZ3oyn4zkwswXY1trnYvS
qZI9nIgbDW60svHmhN2s3Bhd5GAUrGAjVUEWRxv0NIptGtuFaqU189LMTKbK
FlTmBjAIo21gFW1/4h2L1I0pM1MX2k7Ef1uCdjxvtSzhih7hiwEPsO68qKaq
6IGBDlBX1pppoWWjlkyRMyJiWdUumBzIYoY7ogsb7tuONAcv+udl/3zWNY2m
o4ogRfO73iXJCUkcXqVq9CiyQi7h73D0KiOBrOFqZQbFotfWC8g616qgnfjO
LhmE1QXWwHlVYXkfOa/ADSh/uzBWwnV3pATS8Onx6Ao6JOedAx/SGRKDxcWG
dntsI9wMMQFTBTsJh5k4FV+aPC+0EN+RNJoq7xi8SOFTUjwRlqnQOKTu7Zc5
A0I7iJ/ZoL1Bl3NhuzlRtJPFKW17dVFEXZy70GLXQr0yyqpribqcEOGPP/7t
5u3lydnx6Zcvns+Bh4ZUsdUlWYwzSlA/6wr64aDCSiejAYfFHl0bsAJRwLIr
TbvZ5gb9xlONUDLInwhB5IBfjQl4UHfTwqu/9PLCMTzmTUQ8iBcDP5LKCpHY
9uFYXSAG3CUtYBt8nI/M9pSBpJ41HDbWIMEO3i4KVVvYSaqVM2Vg2hbhGTGo
qluzNL8HM0SUsf7eCkCirHXDXpqlgqPoBurApoBQcb6ou3YEuyrUxi1UACUm
IiVMwIoqaIvNOmsZ1np7UuSxWYK7jnugaC/gu0YsvcR9El2tWVQtOfIaISaJ
CvFmVTjWp4zOK2xXVq2cI8KQFAiOQeJ4pixh82+dabQDc5IqgpNU0HsxEuiu
SEkc6jwwQOiOBWDibBlMB6xW3nYWVVfkUdYQAoRPDFtruBD8Pd1EDRVeq2hj
/ZkX0wpuJCilsxV2PYjS4Q/iVu4gG4Jdkaowk6BYRcmT2cyQmhD02rbLN06e
mjawTFTG4dFM+ItunRKgyojXO88ciYC0XbZwO0QTI3+hcLSiGAuoCWu6Z0sM
+sBZrBW4AeFdzCggNbBMg92IMNjTCKvA82ZV16i5jraPN9d0aDoU52TeIIU7
iWki2fZpm2VQKaDysiLJWuHoyhpEnAA6Ir9hd8S8MeWKFGNOWkLrrOFU4E7Y
/MKW7EbBd1tDeScE3ldBUW5b1XZWiLcV7RgMrtAqpyX+AqHeUjgh7y4/wr7/
E1S+eHV69uXL6PGgIcFqwhf9GVxpI77w8S2pGQRzcI2bjSFqVHEgsIPFGVtT
eEniTi/OHiynuiX59NxgUxbIO52H9WdFhI28Chcob3JGstQIX3FQnG+4N4Vq
xAxSF4qynFswsEjyVY7Z2BOw1rLoJuICsI+M84EvFtCSXM8AuBJRmMwKxVhD
ZrgLRoOc+JjwZzic6HnE4QERvpNaZ30zAya4fUBkVnRs+1sOkyTxf10+j3Kw
aqbpz1zXiGxZM6cgbozsFlAmQjzkNXQ7CmNP1jWko6kW5u551YokQnVUWo0z
51tkbvt1mNjCIMQAW5bGcipEhBNw5hqIlzuydUl4zzRTzGwhFeisO4nza1Yk
h4nBXeVDGn+KkZx2jjNTTUrhzZdZJGYqM4VpScf7A3KYiSPamHlArVzaAXgA
OV6uBWK+NEbfwQISNbsjz4tB+EXxJKs0Q1h0HhuOf1eEc3QeQs7ECNiASaAZ
xYCG0afXA8JeEGjcSsxG4l/CtC3uACuuCeq/LmZM7BpbeJfGjIznY6XVLlx1
W4WcCb9zhsQ+8CFaiVA6Q+o+EpcVz0AW+oD4Ie07o7HdtLNQkgP0AhL7DwAl
hOeb0gEGuVmUZIwNhJdAownPXOQ1FITPJ5CeEdLtWE+k6xHJ3jZ+II78EFji
tBtHLoog9R+STX8QgXVTjcwE/zdJmOJDLfabMWTFQ+wckX9+VksXQ88cUkfO
wAxSV+FtisuUA4ciegh4RC/ojvNL3gckqiBSRHSH9RxzrAxgFDO5Xjkk/nTu
CvGXcwx/60x2P4ZHbNo+knInOX395gQnSQgG7qt5o+pFSFJ3EEy+xhdL2PTK
YuNhxp3BiV30gDEQNEi8G6zrocnuU4eUflJeTS6B4zyOOGfQak15s6ESl5XP
OO0NaatYh4iwK4d+4XCbELaO3dQIp+zwvfe6ZUttlSkDN/YTSBIDS2oWmHCp
OtcvfmSoJfUCViY7jQaLOdpJaSP9ItLv9CIBOfe0swr/TmqJvS0IR5z72ZWl
zpChqGbjMow+pcUxS+2reAphybJuPRDjRZEQOqFAq4lhI6UcjyFrKIOsF1X0
geTmNlwZajxbTbPr3ah5HE/GUJj0ra9luAj0mTYMtwh7Unsi+MWlj0FVb/1r
h/ByJRCZCzDkHzcy6g62st10aSg6cNESleu5qeAMONiV9Z7pkdP3thP4PEVO
PzNtyA84OSElfn+T5NGU9ZLCUs7uwjOTwVFTzTYG7gwLLlmBd5pTMBMdwSCA
t6Egh4TR6qUplY9i+9BAhBgo1New+61X2C0ORF13PIoBsUiTMEp5gE0xLYEg
AEAjvuHjPKTmdQA2Li9ZShLWkE1fbvTCjcT0iOaExUY8HYTmIlMNlJsM7XON
/AScxppsvWoOM8bOfWnM6eYwNhRJ3PBzRSVVxMFBcUmY8/A2ZTtpEuRPwZIu
q3LMoq25vgTSeqXxdU6YDyyyrzuS/LlzACsnI0YEfksshoaSDFec9vKu42tu
sxCm/aVa6xVlziDS8WRR1S7keqxe4jJGr4C370gu+HsTo5JYtqE0Lgej6fTe
MiCIeBbOw97Fjdin0pN4Y1qt4LoDSmwnUHkVktmQy+pYEhd7UuckyZhyoaRN
UcED/CzkgNSdS2tGlGTrou4pco5jq36FVS6RpkIBXCCP8BkAW3UtscXrDDHY
kWgHO9CGeJOcBYwt1HZ/FA8e9IULD9sP7AY7jsnKlzXiay48LTTAF5Ed6eSz
o0NxLq+4UointCty7mpyfOxLW4PiEV6PePg46HpC+8g3Q1LdCLIsVcb2BRdt
NPTTgc2DMhoRfUxEv8eJMo7PAwxTBDWSt5d3H+Mbr444MYd0ri4vw+XTF6dH
vNC3kk7g4BSLktCFpnAp1LuYb7Gz4fXgwZqerpdvjkGXGFI5IE7Ki0c8QaEb
n8Fy4oMYfFD5LfWcm3bSRB4NK/mBzl0JgA8XbUew33rNpgzA/e5ZQY4kWFdU
+e8tp1qEMljpPnKmAUlNHjyvsB08hXeVfomv83wstU/aI4gLgEHctANP2hDR
q7R6yAhqqaXXkoKMxaxBipiz8VjnQ5Ap8wvW+Aoy280jxZzeETOkrbj4ij/T
YIFEaJ3r4LRgJIa1I2Lp406ej7czpPd3+LB0Jn+kDWEzQcwwy/6knW/b4lnE
kD7BIfSApngXFirQEPKMESX4oh1VBJbL4LzOdPF7EEGx4w4LD41GeK6ESjSH
JLchijxlTXxF2jJIpZ4NuHrI0Y9X8poxVMEESM32rvxqJI+PJ8cOJo5PxNYO
BDgnASUpcGrl9YC9uHUXkzDC3b5k0RsLl7v8znlYaFAN8TE9BWjtYpAorKHJ
BbELwrrHhpcLRVkHmArNydiZxUcGK9L50zMLf643x8Q5V74LfJDHnrfcW2YE
+oWDuD3UZhzMOSh3wQcLc4kHDZ1AwqlGYCS1FH1OgLW3TJhSJCrHcgay5Cpn
5ZJWywUHSoH6xoYeND1wiTUHWVG1TJzpbsKx99vqqfyAjxJCPjGDck2RvzmN
pnMBfkf9+nIvY1iUrs/JMdxHiRSvI+/eSuRLuhkjpRtJXG8pmSp8s4cLzuZe
E4QIhNhm2S1dS4YsUKf2lBCdZtBJBVAkeZ4Z1oMS/Qxy2FAwldQ6tjwLElDL
D5eB547XetsiPlHFkoonlHQsY2saUtUlor2GgJWQioUZ7h7sFtkBB6QDdem7
GNRSo54JiKPiQ134+rBwZsS8L6g15TNUZwInp2/ekM+lHo27I6fgPLjWchuH
urhWDMv7/KzL46EzTdPVrD50lLDsi+OXL+lR95RoNGdUZAW+aPLq5YsQkAwZ
a6m7wfbdL8VBygW73aczY+cSnL8Pkw6xVwkJZVug0Ys+1wAasO2bIHyr67gH
JB7D3LPJiYfco8kJ9bIGdaVnSY3gkCD4Bcd8fc2Ze5I3SKDY4h8g8q1ZGqS4
IaYvqKUYunCjFKv3e3kOsnYjOAKMsPNDbBGUFxJjRkmO0a8zaAyoDGmJTdYT
UQ2BBZzNjBG61Nz0wZUC+VnhUHBYvafGMkyTtd43euOjXH4jqRNeMD4X+jMz
MLSQSjdjIEgBKT92zKP20JMnILBpqmlnW5HqBNtd7vOK1sEebZnglQejgKdC
c52Bp/n2zJU9u7m+OoR90Byad2BXoG98B/2duN5yn/hxfXHW6pLhzCNyrH4O
6xDCtFYXMxdc4Qk4Uz5crWpSAjiB/k1+wdnKsJZCMId8jRstHCqTdvSzC8nM
wq6SEw9UbPUt+jp5X4yZAtPvrcirdemS1DBj09PCFbfS9fySaN24ikbEgThM
QJOnW0V5Zx19KBoiRJGWwP8/gJFo/Ncgxr+XU1v/eHzySPhH4eMh68TgnbPJ
6/6lfeByeuhywaBoF764M8iDeUgjRHtfWafz/PflRNtWtbA6CtfXq5xLoWov
OxMwM+NOPocz7aLRWKXIgzd6TVkwt9W2Emp+HDLyifTBDDmRpLgF4fuBh6bh
xREhAL9WVzCILU1zFSBEX13makCBciYSwEqzBZ74mqp9Q7QKkUxJGT4eLVtn
235zN49Gz03hrWhWgYL2IqwoeH4k1qvMoE9MRglAI7y9/gxlLsKkkGMzH1KE
Q3LRFqtyARu7+EMgY+VaFg2IkftfU+Q5TVqD41D2TAtjaks908rEiNMqkaae
1JprOgI1P4hGCiaTYj6DCkE7g8Xnlt5LknK2sPfbsqRlcZp8NMh9YxLnCYix
kkhfTnSTZ/EIzqk6yM6BnaVqfUTtFe7kjEKlB9ns7r0RjTllTEUwqLzT+uuk
BYO4x257C6dJond8PFcE3KIgsY/T8o5DK78L2fFLsuO3aXbpQbsvpjz2SYBj
d7nVTerTmkInA06OcophkxKwWj5Rwo/qNRp27pwtczEMaC4XiAb7g1JmBNim
eIGnrHzFJSWETv+KUWzbCX8wdqoXasXfRFTcqoNh/uKLkBdtS/bWbOexkSSZ
kvRUnUb02uXxPvAvIYIskBMo6Io2K/4T0OTjAG5DUpnY+EGCp0n62qbJkCRf
hhUqcsD3SNy4yT7fPhskjw8rQl7FESNVxUr3fYOdSaRQRZAnBW7/tEPlOD/l
cRkFHarN8Zh7g3JxNjmlsPylix/PJq+ecJyhpxSma/yq3v/sEDmvG6X+Iw8+
dvS8CD4gfcnz6MfBRTdtO60+a9zwHkbUVevcixt6mA06oVSh47OHBckhENIZ
LbtaqBWCRwaW9KVoe2RXr8mubhCegkmu9n/b5QBNWoi/V+CRk+vVjnJQr7Ox
GfKNduSwMoRdscWFlM7XPtpIAc+WujqSUPR/JrJffURRl6/KcO9Jj5xzXFa+
FMsrTMTN4CFKO5AXsNL0bd2RC6G5aYe96YlY4VlhLadEceXtUhTuNCH1pOpO
rEK9HlahvsUiGi8iP7nuuCI8Vx4NLM8mJ08HiW9cBpo5345Nr5LhlD1S91vG
+Z19gt9RWeaBR9f/M8mmD6o5AgTOdTsclfBVLpVWk8NjWwNOfrpgexxkRMWb
2MWmZhdNd4e+czwnMor+jK4ofV/SWPIzhGyq3JAHnh9SA68LySb2oeSopiJQ
0qBLVJ6rwn0tT1JAU3tikRzxXIg//EOyXT80VuncHLJq/AzwZx5Z/XTxs/AT
1fwQVLlhICKN9JpoN0iJl7i5IEriegFzuD4XtJNG37jckLl238gPmn2tkafT
9DwTwz0LH39ufddCBIQZsK0BxMPd7nILesJmzHz3iQQ1DlXD8504p29+JmP4
FBtzp8l1cOkrId6fB1Y83qcq7tqa3pFqag9nboIafKqp2uUGgoSrXLjmjPvi
KzaLYwigin6qK/GykKhI59H8LnF7LB+mdEq7piY0D7f4gRVTbITrjIcCisO6
rWGkb4Kf1Kas7VwPV+yufx0fTV6E4tfpk9DzHYI4VwS+Sabi/TS9DfrqvhSx
MhSMH07Q9y17N2TB8/Qr1yoenMd9f8N3fdF590Tp7q+R/CcW++n4ZxdOGg5J
bz5thtPXk9QedsW6EJb3bdBHPj0bSaoxDqZak7H77YLI/iLgiMoJIdfjr/B8
MWHnFx+kA/AswVGQUaSG9A3uwE9S8YR8whJA0UQDEJ+dAB2QIOE/rw79vq89
YLgpBk4IY4GH7Sh+fNSX1VwQF76pSqfEFEx1g7x8Iq7pHrdEhxOKAw5S8X5Y
A+eQAE8iGFtawU0G11nyHZ6kFusn0HwwTpDLEkkUS+xTLLlbY78j40RCCbi7
9Hjpzrv3o5VGuzCM+s0ePQge6evBWP+jvUD68/cfRQQx6n3H6oir3vWL5oa8
o8s4SGcDhcJ66jyoEY46HQiKGr6CnKlMt7FRFt7/3kZX+fiHZLn/fCTsxzuF
2S/hp43Uzu/EeKrh8InRBRFG+HppAihyCi7C2GxtWhqUsbwPFRp9wySkyGpJ
TWtidB/49+Q66GXNo1EGcMW6LzzeX/x88YRsSSfLyj3pP0L2X/lR6kaLXGQU
3iAAmTsM/uO87JZT6o7/xwGPkx58EeIqJkI+1/yrQtpxTR/Hu4GKCwW0kG9V
cQ/CNX9mltJBtWxFrSDo05+rqfxzQ6E30OJdReNoVOBYdA0N6V5V3Vz+lepe
I/mToQiiUfKjyhcbPRKXVUGf9Wr6fBrM/Kjv75W8VUhM1QiGSGSzntzd/vrp
neOxS3pNrbh93Aqvv/yNMPhfU8Hwg6GmRTXrP0dnO4wJLtZx4ayZdo6FPlHs
P7DjD84atY7zPf6baw74xT8AtuSLDNFBAAA=

-->

</rfc>
