d/freebsd-dev
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

At least once mention the long names of WF2Q+ (Worst-case Fair Weighted

Browse Source 
Fair Queueing) and RED (Random Early Detection) to both give the reader
a hint what they are and to make it easier to find out more information
about them.
This commit is contained in:
Ralf S. Engelschall 2001-12-14 21:51:28 +00:00
parent ae22ec847b
commit 43ce89e115
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=87952
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sbin/ipfw/ipfw.8
View File

@ -855,7 +855,7 @@ Packets transit through the pipe according to its parameters.
.Pp
A
.Em queue
is an abstraction used to implement the WF2Q+ policy.
is an abstraction used to implement the WF2Q+ (Worst-case Fair Weighted Fair Queueing) policy.
The queue associates to each flow a weight and a reference pipe.
Then, all flows linked to the same pipe are scheduled at the
rate fixed by the pipe according to the WF2Q+ policy.
@ -1000,7 +1000,7 @@ specifies the aggregate rate for the set of queues.
Specifies the weight to be used for flows matching this queue.
The weight must be in the range 1..100, and defaults to 1.
.It Cm red | gred Ar w_q Ns / Ns Ar min_th Ns / Ns Ar max_th Ns / Ns Ar max_p
Make use of the RED queue management algorithm.
Make use of the RED (Random Early Detection) queue management algorithm.
.Ar w_q
and
.Ar max_p