Browse Prior Art Database

TCP Congestion Control (RFC2581)

IP.com Disclosure Number: IPCOM000003168D
Original Publication Date: 1999-Apr-01
Included in the Prior Art Database: 2000-Sep-13
Document File: 11 page(s) / 29K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

M. Allman: AUTHOR [+3]

Abstract

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.

This text was extracted from a ASCII document.
This is the abbreviated version, containing approximately 9% of the total text.

Network Working Group M. Allman

Request for Comments: 2581 NASA Glenn/Sterling Software

Obsoletes: 2001 V. Paxson

Category: Standards Track ACIRI / ICSI

W. Stevens

Consultant

April 1999

TCP Congestion Control

Status of this Memo

This document specifies an Internet standards track protocol for the

Internet community, and requests discussion and suggestions for

improvements. Please refer to the current edition of the "Internet

Official Protocol Standards" (STD 1) for the standardization state

and status of this protocol. Distribution of this memo is unlimited.

Copyright Notice

Copyright (C) The Internet Society (1999). All Rights Reserved.

Abstract

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.

1. Introduction

This document specifies four TCP [Pos81] congestion control

algorithms: slow start, congestion avoidance, fast retransmit and

fast recovery. These algorithms were devised in [Jac88] and [Jac90].

Their use with TCP is standardized in [Bra89].

This document is an update of [Ste97]. In addition to specifying the

congestion control algorithms, this document specifies what TCP

connections should do after a relatively long idle period, as well as

specifying and clarifying some of the issues pertaining to TCP ACK

generation.

Note that [Ste94] provides examples of these algorithms in action and

[WS95] provides an explanation of the source code for the BSD

implementation of these algorithms.

This document is organized as follows. Section 2 provides various

definitions which will be used throughout the document. Section 3

provides a specification of the congestion control algorithms.

Section 4 outlines concerns related to the congestion control

algorithms and finally, section 5 outlines security considerations.

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",

"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this

document are to be interpreted as described in [Bra97].

2. Definitions

This section provides the de...