datatracker.ietf.org
Sign In
Version 4.50, 2013-05-15
Report a bug

A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP
draft-ietf-tcpm-3517bis-02

RFC
Document Stream: IETF
Last updated: 2012-03-26
Replaces: draft-blanton-tcpm-3517bis
Intended RFC status: Proposed Standard
Other versions: (expired, archived): plain text, pdf, html
IETF State: WG Document (tcpm)
Document shepherd:(None)
Shepherd writeup
Consensus:Unknown
IESG State: RFC 6675
IANA Action State: No IC 
On agenda of 2012-04-12 IESG telechat
Responsible AD: Wesley Eddy
IESG Note: Pasi Sarolahti (pasi.sarolahti@iki.fi) is the document shepherd
Send notices to: tcpm-chairs@tools.ietf.org, draft-ietf-tcpm-3517bis@tools.ietf.org

This Internet-Draft is no longer active. Unofficial copies of old Internet-Drafts can be found here:
http://tools.ietf.org/id/draft-ietf-tcpm-3517bis.

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 5681), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data. This document obsoletes RFC 3517 and describes changes from it. [STANDARDS-TRACK]

Authors:
Ethan Blanton <elb@psg.com>
Mark Allman <mallman@icir.org>
Lili Wang <liliw@juniper.net>
Ilpo Jarvinen <ilpo.jarvinen@helsinki.fi>
Markku Kojo <kojo@cs.helsinki.fi>
Yoshifumi Nishida <nishida@wide.ad.jp>

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