Skip to main content

Tail Loss Probe (TLP): An Algorithm for Fast Recovery of Tail Losses
draft-dukkipati-tcpm-tcp-loss-probe-01

Document Type Expired Internet-Draft (individual in tsv area)
Expired & archived
Authors Nandita Dukkipati , Neal Cardwell , Yuchung Cheng , Matt Mathis
Last updated 2015-10-14 (Latest revision 2013-02-25)
RFC stream Internet Engineering Task Force (IETF)
Intended RFC status Experimental
Formats
Stream WG state (None)
Document shepherd (None)
IESG IESG state Expired (IESG: Dead)
Action Holders
(None)
Consensus boilerplate Unknown
Telechat date (None)
Responsible AD Martin Stiemerling
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

Retransmission timeouts are detrimental to application latency, especially for short transfers such as Web transactions where timeouts can often take longer than all of the rest of a transaction. The primary cause of retransmission timeouts are lost segments at the tail of transactions. This document describes an experimental algorithm for TCP to quickly recover lost segments at the end of transactions or when an entire window of data or acknowledgments are lost. Tail Loss Probe (TLP) is a sender-only algorithm that allows the transport to recover tail losses through fast recovery as opposed to lengthy retransmission timeouts. If a connection is not receiving any acknowledgments for a certain period of time, TLP transmits the last unacknowledged segment (loss probe). In the event of a tail loss in the original transmissions, the acknowledgment from the loss probe triggers SACK/FACK based fast recovery. TLP effectively avoids long timeouts and thereby improves TCP performance.

Authors

Nandita Dukkipati
Neal Cardwell
Yuchung Cheng
Matt Mathis

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