A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
draft-blanton-tcpm-3517bis-01
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Ethan Blanton , Mark Allman , Lili Wang , Ilpo Järvinen , Markku Kojo | ||
| Last updated | 2012-04-19 (Latest revision 2011-04-13) | ||
| Replaced by | draft-ietf-tcpm-3517bis | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-tcpm-3517bis | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data.
Authors
Ethan Blanton
Mark Allman
Lili Wang
Ilpo Järvinen
Markku Kojo
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)