From owner-freebsd-net@FreeBSD.ORG  Tue Sep 29 19:13:30 2009
Return-Path: <owner-freebsd-net@FreeBSD.ORG>
Delivered-To: net@freebsd.org
Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34])
	by hub.freebsd.org (Postfix) with ESMTP id 4288C1065676
	for <net@freebsd.org>; Tue, 29 Sep 2009 19:13:30 +0000 (UTC)
	(envelope-from brett@lariat.net)
Received: from lariat.net (lariat.net [66.119.58.2])
	by mx1.freebsd.org (Postfix) with ESMTP id BAFEC8FC18
	for <net@freebsd.org>; Tue, 29 Sep 2009 19:13:29 +0000 (UTC)
Received: from anne-o1dpaayth1.lariat.net (IDENT:ppp1000.lariat.net@lariat.net
	[66.119.58.2]) by lariat.net (8.9.3/8.9.3) with ESMTP id MAA21423
	for <net@freebsd.org>; Tue, 29 Sep 2009 12:55:09 -0600 (MDT)
Message-Id: <200909291855.MAA21423@lariat.net>
X-Mailer: QUALCOMM Windows Eudora Version 7.1.0.9
Date: Tue, 29 Sep 2009 12:54:53 -0600
To: net@freebsd.org
From: Brett Glass <brett@lariat.net>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"; format=flowed
Cc: 
Subject: ipfw gred parameters
X-BeenThere: freebsd-net@freebsd.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: Networking and TCP/IP with FreeBSD <freebsd-net.freebsd.org>
List-Unsubscribe: <http://lists.freebsd.org/mailman/listinfo/freebsd-net>,
	<mailto:freebsd-net-request@freebsd.org?subject=unsubscribe>
List-Archive: <http://lists.freebsd.org/pipermail/freebsd-net>
List-Post: <mailto:freebsd-net@freebsd.org>
List-Help: <mailto:freebsd-net-request@freebsd.org?subject=help>
List-Subscribe: <http://lists.freebsd.org/mailman/listinfo/freebsd-net>,
	<mailto:freebsd-net-request@freebsd.org?subject=subscribe>
X-List-Received-Date: Tue, 29 Sep 2009 19:13:30 -0000

I've been trying to determine the best parameters for gred ("gentle 
RED") to allow graceful bandwidth limiting in ipfw, but have found 
precious little guidance on the Web as to what the parameters mean. 
The code gives some hints, but I'm still uncertain: what parameters 
work best in a typical system? And how do the parameters submitted 
to "dummynet" correspond to the ones usually seen in descriptions 
of the algorithm?

--Brett Glass