[tcpm] Fwd: New Version Notification for draft-jarvinen-tcpm-sack-recovery-entry-01

" Ilpo Järvinen " <ilpo.jarvinen@helsinki.fi> Wed, 05 August 2009 11:12 UTC

Return-Path: <ilpo.jarvinen@helsinki.fi>
X-Original-To: tcpm@core3.amsl.com
Delivered-To: tcpm@core3.amsl.com
Received: from localhost (localhost []) by core3.amsl.com (Postfix) with ESMTP id 32C5F3A7184 for <tcpm@core3.amsl.com>; Wed, 5 Aug 2009 04:12:36 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -4.872
X-Spam-Status: No, score=-4.872 tagged_above=-999 required=5 tests=[AWL=-0.873, BAYES_00=-2.599, MANGLED_TOOL=2.3, MIME_8BIT_HEADER=0.3, RCVD_IN_DNSWL_MED=-4]
Received: from mail.ietf.org ([]) by localhost (core3.amsl.com []) (amavisd-new, port 10024) with ESMTP id YoIVRI9b+ilL for <tcpm@core3.amsl.com>; Wed, 5 Aug 2009 04:12:35 -0700 (PDT)
Received: from mail.cs.helsinki.fi (courier.cs.helsinki.fi []) by core3.amsl.com (Postfix) with ESMTP id 353AF3A6BA4 for <tcpm@ietf.org>; Wed, 5 Aug 2009 04:12:34 -0700 (PDT)
Received: from wel-95.cs.helsinki.fi (wel-95.cs.helsinki.fi []) (AUTH: PLAIN cs-relay, TLS: TLSv1/SSLv3,256bits,AES256-SHA) by mail.cs.helsinki.fi with esmtp; Wed, 05 Aug 2009 14:12:35 +0300 id 0008C24E.4A796923.0000494F
Received: by wel-95.cs.helsinki.fi (Postfix, from userid 50795) id D8AE5202141; Wed, 5 Aug 2009 14:12:35 +0300 (EEST)
Received: from localhost (localhost []) by wel-95.cs.helsinki.fi (Postfix) with ESMTP id D55F4202140; Wed, 5 Aug 2009 14:12:35 +0300 (EEST)
Date: Wed, 05 Aug 2009 14:12:35 +0300
From: Ilpo Järvinen <ilpo.jarvinen@helsinki.fi>
X-X-Sender: ijjarvin@wel-95.cs.helsinki.fi
To: tcpm@ietf.org
Message-ID: <alpine.DEB.2.00.0908051409200.10654@wel-95.cs.helsinki.fi>
User-Agent: Alpine 2.00 (DEB 1167 2008-08-23)
MIME-Version: 1.0
Content-Type: MULTIPART/MIXED; boundary="8323329-901203034-1249470664=:10654"
Content-ID: <alpine.DEB.2.00.0908051412260.10654@wel-95.cs.helsinki.fi>
Cc: Markku Kojo <kojo@cs.Helsinki.FI>
Subject: [tcpm] Fwd: New Version Notification for draft-jarvinen-tcpm-sack-recovery-entry-01
X-BeenThere: tcpm@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: TCP Maintenance and Minor Extensions Working Group <tcpm.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/tcpm>, <mailto:tcpm-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/tcpm>
List-Post: <mailto:tcpm@ietf.org>
List-Help: <mailto:tcpm-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/tcpm>, <mailto:tcpm-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 05 Aug 2009 11:12:36 -0000

Hi all,

We've just uploaded 01 version which is effectively the same version as
the unofficial 01a that was used as the basis of the presentation in
the Stockholm meeting. Only the following placeholders for TBD items
were added to -01 version:
- A note on Window Updates, yet another case where the improved
   algorithm has a benefit (thanks to corridor talk with Anna Brunström)
- Clarified the dupack counting rule for the case where the
   duplicate ACKs don't come "in a row"

Any feedback is more than welcome.

In the meeting it was also decided take to the mailing list the
further discussion on whether there's interest in adopting this
as a WG item?


From: IETF I-D Submission Tool <idsubmission@ietf.org>
To: ilpo.jarvinen@helsinki.fi
Cc: kojo@cs.helsinki.fi
Subject: New Version Notification for
Date: Wed,  5 Aug 2009 02:06:14 -0700 (PDT)

A new version of I-D, draft-jarvinen-tcpm-sack-recovery-entry-01.txt has been successfuly submitted by Ilpo Jarvinen and posted to the IETF repository.

Filename:	 draft-jarvinen-tcpm-sack-recovery-entry
Revision:	 01
Title:		 Using TCP Selective Acknowledgement (SACK) Information to Determine Duplicate Acknowledgements for Loss Recovery Initiation
Creation_date:	 2009-08-05
WG ID:		 Independent Submission
Number_of_pages: 15

This document describes a TCP sender algorithm to trigger loss
  recovery based on the information gathered on a SACK scoreboard
  instead of simply counting the number of arriving duplicate
  acknowledgements 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.

The IETF Secretariat.