BCP 133, RFC 9743 on Specifying New Congestion Control Algorithms

rfc-editor@rfc-editor.org Wed, 12 March 2025 23:05 UTC

Return-Path: <wwwrun@rfcpa.rfc-editor.org>
X-Original-To: ietf-announce@ietf.org
Delivered-To: ietf-announce@mail2.ietf.org
Received: from rfcpa.rfc-editor.org (unknown [167.172.21.234]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature ECDSA (P-256) server-digest SHA256) (No client certificate requested) by mail2.ietf.org (Postfix) with ESMTPS id 713FDA95699; Wed, 12 Mar 2025 16:05:11 -0700 (PDT)
Received: by rfcpa.rfc-editor.org (Postfix, from userid 461) id 3421B236A9C; Wed, 12 Mar 2025 16:05:11 -0700 (PDT)
To: ietf-announce@ietf.org, rfc-dist@rfc-editor.org
Subject: BCP 133, RFC 9743 on Specifying New Congestion Control Algorithms
From: rfc-editor@rfc-editor.org
Content-type: text/plain; charset="UTF-8"
Message-Id: <20250312230511.3421B236A9C@rfcpa.rfc-editor.org>
Date: Wed, 12 Mar 2025 16:05:11 -0700
Message-ID-Hash: EMEV7NYBZJEMCXBKM2S7U7SOKS4LJKVU
X-Message-ID-Hash: EMEV7NYBZJEMCXBKM2S7U7SOKS4LJKVU
X-MailFrom: wwwrun@rfcpa.rfc-editor.org
X-Mailman-Rule-Misses: dmarc-mitigation; no-senders; approved; emergency; loop; banned-address; member-moderation; header-match-ietf-announce.ietf.org-0; nonmember-moderation; administrivia; implicit-dest; max-recipients; max-size; news-moderation; no-subject; digests; suspicious-header
CC: rfc-editor@rfc-editor.org, drafts-update-ref@iana.org, ccwg@ietf.org
X-Mailman-Version: 3.3.9rc6
Precedence: list
List-Id: "IETF announcement list. No discussions." <ietf-announce.ietf.org>
Archived-At: <https://mailarchive.ietf.org/arch/msg/ietf-announce/K-0kTuzMdlJR3H9qJnVI3dQIPUo>
List-Archive: <https://mailarchive.ietf.org/arch/browse/ietf-announce>
List-Help: <mailto:ietf-announce-request@ietf.org?subject=help>
List-Owner: <mailto:ietf-announce-owner@ietf.org>
List-Post: <mailto:ietf-announce@ietf.org>
List-Subscribe: <mailto:ietf-announce-join@ietf.org>
List-Unsubscribe: <mailto:ietf-announce-leave@ietf.org>

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

        BCP 133        
        RFC 9743

        Title:      Specifying New Congestion Control Algorithms 
        Author:     M. Duke, Ed.,
                    G. Fairhurst, Ed.
        Status:     Best Current Practice
        Stream:     IETF
        Date:       March 2025
        Mailbox:    martin.h.duke@gmail.com,
                    gorry@erg.abdn.ac.uk
        Pages:      23
        Obsoletes:  RFC 5033
        See Also:   BCP 133

        I-D Tag:    draft-ietf-ccwg-rfc5033bis-08.txt

        URL:        https://www.rfc-editor.org/info/rfc9743

        DOI:        10.17487/RFC9743

RFC 5033 discusses the principles and guidelines for standardizing
new congestion control algorithms.  This document obsoletes RFC 5033
to reflect changes in the congestion control landscape by providing a
framework for the development and assessment of congestion control
mechanisms, promoting stability across diverse network paths.  This
document seeks to ensure that proposed congestion control algorithms
operate efficiently and without harm when used in the global
Internet. It emphasizes the need for comprehensive testing and
validation to prevent adverse interactions with existing flows.

This document is a product of the Congestion Control Working Group 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
  https://www.ietf.org/mailman/listinfo/ietf-announce
  https://mailman.rfc-editor.org/mailman/listinfo/rfc-dist

For searching the RFC series, see https://www.rfc-editor.org/search
For downloading RFCs, see https://www.rfc-editor.org/retrieve/bulk

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