Date: Mon, 16 Jun 1997 21:22:10 +1000 (EST) From: Darren Reed <avalon@coombs.anu.edu.au> To: luigi@iet.unipi.it (Luigi Rizzo) Cc: hackers@FreeBSD.ORG Subject: Re: rr queueing Message-ID: <199706161130.EAA29823@hub.freebsd.org> In-Reply-To: <199706160927.LAA00577@prova.iet.unipi.it> from "Luigi Rizzo" at Jun 16, 97 11:27:25 am
next in thread | previous in thread | raw e-mail | index | archive | help
In some mail from Luigi Rizzo, sie said: > > I have some preliminary code for implementing RR queueing and > associated stuff (including bw allocation) in the bottom layers of > the networking stack. When complete (although it pretty much works > even now) it is meant to replace the IF_ENQUEUE/IF_DEQUEUE macros. > As such, I have tried to make the code and the algorithms fast and > efficient. The code includes some description on what it does and > how, so if you have comments and suggestions on how to improve it > or add more features, let me know. Did I miss something or... Is it faster than IF_ENQUEUE/IF_DEQUEUE ? Does it fix some mysterious problem/bug that currently exists ? Darren
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199706161130.EAA29823>