A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
draft-blanton-tcpm-3517bis-01

Document Type Replaced Internet-Draft (individual)
Last updated 2012-04-19 (latest revision 2011-04-13)
Replaced by draft-ietf-tcpm-3517bis
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-tcpm-3517bis
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-blanton-tcpm-3517bis-01.txt

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 (eblanton@cs.purdue.edu)
Mark Allman (mallman@icir.org)
Lili Wang (liliw@juniper.net)
Ilpo Jarvinen (ilpo.jarvinen@helsinki.fi)
Markku Kojo (kojo@cs.helsinki.fi)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)