Using TCP Selective Acknowledgement (SACK) Information to Determine Duplicate Acknowledgements for Loss Recovery Initiation
draft-ietf-tcpm-sack-recovery-entry-01

Document Type Expired Internet-Draft (tcpm WG)
Last updated 2010-03-08
Replaces draft-jarvinen-tcpm-sack-recovery-entry
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
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-ietf-tcpm-sack-recovery-entry-01.txt

Abstract

This document describes a TCP sender algorithm to trigger loss recovery based on the TCP Selective Acknowledgement (SACK) information gathered on a SACK scoreboard instead of simply counting the number of arriving duplicate acknowledgements (ACKs) in the traditional way. The given algorithm is more robust to ACK losses, ACK reordering, missed duplicate acknowledgements due to delayed acknowledgements, and extra duplicate acknowledgements due to duplicated segments and out-of-window segments. The algorithm allows not only a timely initiation of TCP loss recovery but also reduces false fast retransmits. It has a low implementation cost on top of the SACK scoreboard defined in RFC 3517.

Authors

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.)