1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557
|
<pre>Network Working Group S. Floyd
Request for Comments: 5033 M. Allman
BCP: 133 ICIR / ICSI
Category: Best Current Practice August 2007
<span class="h1">Specifying New Congestion Control Algorithms</span>
Status of This Memo
This document specifies an Internet Best Current Practices for the
Internet Community, and requests discussion and suggestions for
improvements. Distribution of this memo is unlimited.
Abstract
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.
<span class="grey">Floyd & Allman Best Current Practice [Page 1]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
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 [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>].
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.
The guidelines in this document are intended to be consistent with
the congestion control principles from [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>] of preventing
congestion collapse, considering fairness, and optimizing the flow's
own performance in terms of throughput, delay, and loss. [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>]
also discusses the goal of avoiding a congestion control "arms race"
among competing transport protocols.
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.
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.
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Document Status</span>
Following the lead of HighSpeed TCP [<a href="./rfc3649" title=""HighSpeed TCP for Large Congestion Windows"">RFC3649</a>], 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.
<span class="grey">Floyd & Allman Best Current Practice [Page 2]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
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 *safe* for use, but still is not *recommended*
for use because it does not perform well for the user.
As examples of such statements, [<a href="./rfc3649" title=""HighSpeed TCP for Large Congestion Windows"">RFC3649</a>] 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 [<a href="./rfc4782" title=""Quick- Start for TCP and IP"">RFC4782</a>] 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.
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.
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.
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Guidelines</span>
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
<span class="grey">Floyd & Allman Best Current Practice [Page 3]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
fall outside the scope of these guidelines are certainly possible;
these guidelines should not be considered as an all-encompassing
check-list.
(0) Differences with Congestion Control Principles [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>]
Proposed congestion control mechanisms should include a clear
explanation of the deviations from [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>].
(1) Impact on Standard TCP, SCTP [<a href="./rfc2960" title=""Stream Control Transmission Protocol"">RFC2960</a>], and DCCP [<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>].
Proposed congestion control mechanisms should be evaluated when
competing with standard IETF congestion control [RFC2581,
<a href="./rfc2960">RFC2960</a>, <a href="./rfc4340">RFC4340</a>]. 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.
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.
As an example from an Experimental RFC, fairness with standard
TCP is discussed in Sections <a href="#section-4">4</a> and <a href="#section-6">6</a> of [<a href="./rfc3649" title=""HighSpeed TCP for Large Congestion Windows"">RFC3649</a>] (HighSpeed TCP)
and using spare capacity is discussed in Sections <a href="#section-6">6</a>, <a href="#section-11.1">11.1</a>, and <a href="#section-12">12</a>
of [<a href="./rfc3649" title=""HighSpeed TCP for Large Congestion Windows"">RFC3649</a>].
(2) Difficult Environments.
The proposed algorithms should be assessed in difficult
environments such as paths containing wireless links.
Characteristics of wireless environments are discussed in
[<a href="./rfc3819" title=""Advice for Internet Subnetwork Designers"">RFC3819</a>] and in Section 16 of [<a href="#ref-Tools" title="Work in Progress">Tools</a>]. 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.
<span class="grey">Floyd & Allman Best Current Practice [Page 4]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
While it is impossible to enumerate all the possible "difficult
environments", we note that the IETF has previously grappled with
paths with long delays [<a href="./rfc2488" title=""Enhancing TCP Over Satellite Channels using Standard Mechanisms"">RFC2488</a>], high delay bandwidth products
[<a href="./rfc3649" title=""HighSpeed TCP for Large Congestion Windows"">RFC3649</a>], high packet corruption rates [<a href="./rfc3155" title=""End-to-end Performance Implications of Links with Errors"">RFC3155</a>], packet
reordering [<a href="./rfc4653" title=""Improving the Robustness of TCP to Non-Congestion Events"">RFC4653</a>], and significantly slow links [<a href="./rfc3150" title=""End-to-end Performance Implications of Slow Links"">RFC3150</a>].
Aspects of alternate congestion control that impact networks with
these characteristics should be detailed.
As an example from an Experimental RFC, performance in difficult
environments is discussed in Sections <a href="#section-6">6</a>, <a href="#section-9.2">9.2</a>, and <a href="#section-10.2">10.2</a> of
[<a href="./rfc4782" title=""Quick- Start for TCP and IP"">RFC4782</a>] (Quick-Start).
(3) Investigating a Range of Environments.
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) [<a href="#ref-FJ03" title="V.">FJ03</a>] and Drop-Tail.
This evaluation is often not included in the internet-draft
itself, but in related papers cited in the draft.
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.
As an example from an Experimental RFC, performance in a range of
environments is discussed in <a href="./rfc3649#section-12">Section 12 of [RFC3649]</a> (HighSpeed
TCP) and <a href="./rfc4782#section-9.7">Section 9.7 of [RFC4782]</a> (Quick-Start).
(4) Protection Against Congestion Collapse.
The alternate congestion control mechanism should either stop
sending when the packet drop rate exceeds some threshold
[<a href="./rfc3714" title=""IAB Concerns Regarding Congestion Control for Voice Traffic in the Internet"">RFC3714</a>], 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 [<a href="./rfc2914" title=""Congestion Control Principles"">RFC2914</a>], this
requirement is crucial to protect the network in times of extreme
congestion.
<span class="grey">Floyd & Allman Best Current Practice [Page 5]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
If "full backoff" is used, this bullet does not require that the
full backoff mechanism must be identical to that of TCP
[<a href="./rfc2988" title=""Computing TCP's Retransmission Timer"">RFC2988</a>]. As an example, this bullet does not preclude full
backoff mechanisms that would give flows with different round-
trip times comparable bandwidth during backoff.
(5) Fairness within the Alternate Congestion Control Algorithm.
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.
(6) Performance with Misbehaving Nodes and Outside Attackers.
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.
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 [<a href="./rfc4782" title=""Quick- Start for TCP and IP"">RFC4782</a>] (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.
(7) Responses to Sudden or Transient Events.
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 [<a href="#ref-Tools" title="Work in Progress">Tools</a>].
As an example from an Experimental RFC, response to transient
events is discussed in <a href="./rfc4782#section-9.2">Section 9.2 of [RFC4782]</a> (Quick-Start).
(8) Incremental Deployment.
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
<span class="grey">Floyd & Allman Best Current Practice [Page 6]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
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.
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.
As an example from an Experimental RFC, deployment issues are
discussed in Sections <a href="#section-10.3">10.3</a> and <a href="#section-10.4">10.4</a> of [<a href="./rfc4782" title=""Quick- Start for TCP and IP"">RFC4782</a>] (Quick-Start).
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Minimum Requirements</span>
This section suggests minimum requirements for a document to be
approved as Experimental with approval for widespread deployment in
the global Internet.
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.
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.
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Security Considerations</span>
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 [<a href="./rfc2581" title=""TCP Congestion Control"">RFC2581</a>]). Alternate congestion control
schemes should be mindful of such pitfalls, as well, and should
examine any potential security issues that may arise.
<span class="grey">Floyd & Allman Best Current Practice [Page 7]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Acknowledgments</span>
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 [<a href="#ref-Metrics" title="Work in Progress">Metrics</a>].
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Normative References</span>
[<a id="ref-RFC2581">RFC2581</a>] Allman, M., Paxson, V., and W. Stevens, "TCP Congestion
Control", <a href="./rfc2581">RFC 2581</a>, April 1999.
[<a id="ref-RFC2914">RFC2914</a>] Floyd, S., "Congestion Control Principles", <a href="https://www.rfc-editor.org/bcp/bcp41">BCP 41</a>, <a href="./rfc2914">RFC</a>
<a href="./rfc2914">2914</a>, September 2000.
[<a id="ref-RFC2960">RFC2960</a>] Stewart, R., Xie, Q., Morneault, K., Sharp, C.,
Schwarzbauer, H., Taylor, T., Rytina, I., Kalla, M., Zhang,
L., and V. Paxson, "Stream Control Transmission Protocol",
<a href="./rfc2960">RFC 2960</a>, October 2000.
[<a id="ref-RFC4340">RFC4340</a>] Kohler, E., Handley, M., and S. Floyd, "Datagram Congestion
Control Protocol (DCCP)", <a href="./rfc4340">RFC 4340</a>, March 2006.
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Informative References</span>
[<a id="ref-FJ03">FJ03</a>] Floyd, S., and Jacobson, V., Random Early Detection
Gateways for Congestion Avoidance, IEEE/ACM Transactions on
Networking, V.1 N.4, August 1993.
[<a id="ref-Metrics">Metrics</a>] S. Floyd, Metrics for the Evaluation of Congestion Control
Mechanisms, Work in Progress, July 2007.
[<a id="ref-RFC2488">RFC2488</a>] Allman, M., Glover, D., and L. Sanchez, "Enhancing TCP Over
Satellite Channels using Standard Mechanisms", <a href="https://www.rfc-editor.org/bcp/bcp28">BCP 28</a>, <a href="./rfc2488">RFC</a>
<a href="./rfc2488">2488</a>, January 1999.
[<a id="ref-RFC2988">RFC2988</a>] Paxson, V. and M. Allman, "Computing TCP's Retransmission
Timer", <a href="./rfc2988">RFC 2988</a>, November 2000.
[<a id="ref-RFC3150">RFC3150</a>] Dawkins, S., Montenegro, G., Kojo, M., and V. Magret,
"End-to-end Performance Implications of Slow Links", <a href="https://www.rfc-editor.org/bcp/bcp48">BCP</a>
<a href="https://www.rfc-editor.org/bcp/bcp48">48</a>, <a href="./rfc3150">RFC 3150</a>, July 2001.
[<a id="ref-RFC3155">RFC3155</a>] Dawkins, S., Montenegro, G., Kojo, M., Magret, V., and N.
Vaidya, "End-to-end Performance Implications of Links with
Errors", <a href="https://www.rfc-editor.org/bcp/bcp50">BCP 50</a>, <a href="./rfc3155">RFC 3155</a>, August 2001.
<span class="grey">Floyd & Allman Best Current Practice [Page 8]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
[<a id="ref-RFC3649">RFC3649</a>] Floyd, S., "HighSpeed TCP for Large Congestion Windows",
<a href="./rfc3649">RFC 3649</a>, December 2003.
[<a id="ref-RFC3714">RFC3714</a>] Floyd, S. and J. Kempf, "IAB Concerns Regarding Congestion
Control for Voice Traffic in the Internet", <a href="./rfc3714">RFC 3714</a>, March
2004.
[<a id="ref-RFC3819">RFC3819</a>] Karn, P., Bormann, C., Fairhurst, G., Grossman, D., Ludwig,
R., Mahdavi, J., Montenegro, G., Touch, J., and L. Wood,
"Advice for Internet Subnetwork Designers", <a href="https://www.rfc-editor.org/bcp/bcp89">BCP 89</a>, <a href="./rfc3819">RFC</a>
<a href="./rfc3819">3819</a>, July 2004.
[<a id="ref-RFC4653">RFC4653</a>] Bhandarkar, S., Reddy, A. N., Allman, M., and E. Blanton,
"Improving the Robustness of TCP to Non-Congestion Events",
<a href="./rfc4653">RFC 4653</a>, August 2006.
[<a id="ref-RFC4782">RFC4782</a>] Floyd, S., Allman, M., Jain, A., and P. Sarolahti, "Quick-
Start for TCP and IP", <a href="./rfc4782">RFC 4782</a>, January 2007.
[<a id="ref-Tools">Tools</a>] S. Floyd and E. Kohler, Tools for the Evaluation of
Simulation and Testbed Scenarios, Work in Progress, July
2007.
Authors' Addresses
Sally Floyd
ICIR (ICSI Center for Internet Research)
1947 Center Street, Suite 600
Berkeley, CA 94704-1198
Phone: +1 (510) 666-2989
EMail: floyd@icir.org
URL: <a href="http://www.icir.org/floyd/">http://www.icir.org/floyd/</a>
Mark Allman
ICSI Center for Internet Research
1947 Center Street, Suite 600
Berkeley, CA 94704-1198
Phone: (440) 235-1792
EMail: mallman@icir.org
URL: <a href="http://www.icir.org/mallman/">http://www.icir.org/mallman/</a>
<span class="grey">Floyd & Allman Best Current Practice [Page 9]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
<span class="grey"><a href="./rfc5033">RFC 5033</a> Specifying New Congestion Control Algorithms August 2007</span>
Full Copyright Statement
Copyright (C) The IETF Trust (2007).
This document is subject to the rights, licenses and restrictions
contained in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a>, and except as set forth therein, the authors
retain all their rights.
This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Intellectual Property
The IETF takes no position regarding the validity or scope of any
Intellectual Property Rights or other rights that might be claimed to
pertain to the implementation or use of the technology described in
this document or the extent to which any license under such rights
might or might not be available; nor does it represent that it has
made any independent effort to identify any such rights. Information
on the procedures with respect to rights in RFC documents can be
found in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and <a href="https://www.rfc-editor.org/bcp/bcp79">BCP 79</a>.
Copies of IPR disclosures made to the IETF Secretariat and any
assurances of licenses to be made available, or the result of an
attempt made to obtain a general license or permission for the use of
such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at
<a href="http://www.ietf.org/ipr">http://www.ietf.org/ipr</a>.
The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement
this standard. Please address the information to the IETF at
ietf-ipr@ietf.org.
Floyd & Allman Best Current Practice [Page 10]
</pre>
|