RFC 6675 on A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP
rfc-editor@rfc-editor.org Fri, 24 August 2012 23:33 UTC
Return-Path: <wwwrun@rfc-editor.org>
X-Original-To: ietf-announce@ietfa.amsl.com
Delivered-To: ietf-announce@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id CC88D21F8533; Fri, 24 Aug 2012 16:33:11 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -102.004
X-Spam-Level:
X-Spam-Status: No, score=-102.004 tagged_above=-999 required=5 tests=[AWL=-0.004, BAYES_00=-2.599, J_CHICKENPOX_93=0.6, NO_RELAYS=-0.001, USER_IN_WHITELIST=-100]
Received: from mail.ietf.org ([64.170.98.30]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 1BOmn5jYsXle; Fri, 24 Aug 2012 16:33:11 -0700 (PDT)
Received: from rfc-editor.org (rfc-editor.org [IPv6:2001:1890:123a::1:2f]) by ietfa.amsl.com (Postfix) with ESMTP id 6AB9D21F8530; Fri, 24 Aug 2012 16:33:11 -0700 (PDT)
Received: by rfc-editor.org (Postfix, from userid 30) id 52C88B1E00B; Fri, 24 Aug 2012 16:31:08 -0700 (PDT)
To: ietf-announce@ietf.org, rfc-dist@rfc-editor.org
Subject: RFC 6675 on A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP
From: rfc-editor@rfc-editor.org
Message-Id: <20120824233108.52C88B1E00B@rfc-editor.org>
Date: Fri, 24 Aug 2012 16:31:08 -0700
Cc: tcpm@ietf.org, rfc-editor@rfc-editor.org
X-BeenThere: ietf-announce@ietf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: "IETF announcement list. No discussions." <ietf-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/ietf-announce>
List-Post: <mailto:ietf-announce@ietf.org>
List-Help: <mailto:ietf-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/ietf-announce>, <mailto:ietf-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 24 Aug 2012 23:33:12 -0000
A new Request for Comments is now available in online RFC libraries. RFC 6675 Title: A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP Author: E. Blanton, M. Allman, L. Wang, I. Jarvinen, M. Kojo, Y. Nishida Status: Standards Track Stream: IETF Date: August 2012 Mailbox: elb@psg.com, mallman@icir.org, liliw@juniper.net, ilpo.jarvinen@helsinki.fi, kojo@cs.helsinki.fi, nishida@wide.ad.jp Pages: 15 Characters: 34484 Obsoletes: RFC3517 I-D Tag: draft-ietf-tcpm-3517bis-02.txt URL: http://www.rfc-editor.org/rfc/rfc6675.txt 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] This document is a product of the TCP Maintenance and Minor Extensions Working Group of the IETF. This is now a Proposed Standard Protocol. STANDARDS TRACK: This document specifies an Internet standards track protocol for the Internet community,and requests discussion and suggestions for improvements. Please refer to the current edition of the Internet Official Protocol Standards (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. This announcement is sent to the IETF-Announce and rfc-dist lists. To subscribe or unsubscribe, see http://www.ietf.org/mailman/listinfo/ietf-announce http://mailman.rfc-editor.org/mailman/listinfo/rfc-dist For searching the RFC series, see http://www.rfc-editor.org/rfcsearch.html. For downloading RFCs, see http://www.rfc-editor.org/rfc.html. Requests for special distribution should be addressed to either the author of the RFC in question, or to rfc-editor@rfc-editor.org. Unless specifically noted otherwise on the RFC itself, all RFCs are for unlimited distribution. The RFC Editor Team Association Management Solutions, LLC