[BEHAVE] BCP 150, RFC 5597 on Network Address Translation (NAT) Behavioral Requirements for the Datagram Congestion Control Protocol

rfc-editor@rfc-editor.org Thu, 17 September 2009 23:08 UTC

Return-Path: <rfc-editor@rfc-editor.org>
X-Original-To: behave@core3.amsl.com
Delivered-To: behave@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id 49E203A6B1F; Thu, 17 Sep 2009 16:08:25 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -16.886
X-Spam-Level:
X-Spam-Status: No, score=-16.886 tagged_above=-999 required=5 tests=[AWL=0.713, BAYES_00=-2.599, USER_IN_DEF_WHITELIST=-15]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id o801-IDEl5Qr; Thu, 17 Sep 2009 16:08:24 -0700 (PDT)
Received: from bosco.isi.edu (bosco.isi.edu [128.9.168.207]) by core3.amsl.com (Postfix) with ESMTP id 85ED728C162; Thu, 17 Sep 2009 16:08:24 -0700 (PDT)
Received: by bosco.isi.edu (Postfix, from userid 70) id 372843256F6; Thu, 17 Sep 2009 16:08:49 -0700 (PDT)
To: ietf-announce@ietf.org, rfc-dist@rfc-editor.org
From: rfc-editor@rfc-editor.org
Message-Id: <20090917230849.372843256F6@bosco.isi.edu>
Date: Thu, 17 Sep 2009 16:08:49 -0700
Cc: behave@ietf.org, rfc-editor@rfc-editor.org
Subject: [BEHAVE] BCP 150, RFC 5597 on Network Address Translation (NAT) Behavioral Requirements for the Datagram Congestion Control Protocol
X-BeenThere: behave@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: mailing list of BEHAVE IETF WG <behave.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/behave>, <mailto:behave-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/behave>
List-Post: <mailto:behave@ietf.org>
List-Help: <mailto:behave-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/behave>, <mailto:behave-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 17 Sep 2009 23:08:25 -0000

A new Request for Comments is now available in online RFC libraries.

        BCP 150        
        RFC 5597

        Title:      Network Address Translation (NAT) Behavioral 
                    Requirements for the Datagram Congestion Control 
                    Protocol 
        Author:     R. Denis-Courmont
        Status:     Best Current Practice
        Date:       September 2009
        Mailbox:    rem@videolan.org
        Pages:      9
        Characters: 18933
        See Also:   BCP00150

        I-D Tag:    draft-ietf-behave-dccp-05.txt

        URL:        http://www.rfc-editor.org/rfc/rfc5597.txt

This document defines a set of requirements for NATs handling the
Datagram Congestion Control Protocol (DCCP).  These requirements
allow DCCP applications, such as streaming applications, to operate
consistently, and they are very similar to the TCP requirements for
NATs, which have already been published by the IETF.  Ensuring that
NATs meet this set of requirements will greatly increase the
likelihood that applications using DCCP will function properly.  This 
document specifies an Internet Best Current Practices for the
Internet Community, and requests discussion and suggestions for
improvements.

This document is a product of the Behavior Engineering for Hindrance Avoidance Working Group of the IETF.


BCP: This document specifies an Internet Best Current Practices for the
Internet Community, and requests discussion and suggestions for 
improvements. 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
USC/Information Sciences Institute