White space fix only. Translators can ignore.
Sponsored by: iXsystems
This commit is contained in:
Dru Lavigne
parent
548e3ed7fe
commit
019f21a9de
Notes:
svn2git
2020-12-08 03:00:23 +00:00
svn path=/head/; revision=43925
1 changed files with 34 additions and 37 deletions
|
|
@ -277,7 +277,7 @@
|
|||
additional flags to pass to &man.pflog.4; when it is
|
||||
started:</para>
|
||||
|
||||
<programlisting>pflog_logfile="/var/log/pflog" # where pflogd should store the logfile
|
||||
<programlisting>pflog_logfile="/var/log/pflog" # where pflogd should store the logfile
|
||||
pflog_flags="" # additional flags for pflogd startup</programlisting>
|
||||
|
||||
<para>Finally, if there is a <acronym>LAN</acronym> behind the
|
||||
|
|
@ -351,23 +351,23 @@ device pfsync</programlisting>
|
|||
|
||||
<para>On &os;, <application>ALTQ</application> can be used with
|
||||
<application>PF</application> to provide Quality of Service
|
||||
(<acronym>QOS</acronym>). Once <application>ALTQ</application> is
|
||||
enabled, queues can be defined in the ruleset which
|
||||
determine the processing priority of outbound packets.
|
||||
</para>
|
||||
(<acronym>QOS</acronym>). Once
|
||||
<application>ALTQ</application> is enabled, queues can be
|
||||
defined in the ruleset which determine the processing priority
|
||||
of outbound packets.</para>
|
||||
|
||||
<para>Before enabling <application>ALTQ</application>, refer to
|
||||
&man.altq.4;
|
||||
to determine if the drivers for the network cards installed on the system support
|
||||
it.</para>
|
||||
&man.altq.4; to determine if the drivers for the network cards
|
||||
installed on the system support it.</para>
|
||||
|
||||
<para><application>ALTQ</application> is not available as a
|
||||
loadable kernel module. If the system's interfaces support <application>ALTQ</application>,
|
||||
create a custom kernel using the instructions in <xref linkend="kernelconfig"/>.
|
||||
The following kernel options are available. The first is
|
||||
needed to enable
|
||||
<application>ALTQ</application>. At least one of the other options
|
||||
is necessary to specify the queueing scheduler algorithm:</para>
|
||||
loadable kernel module. If the system's interfaces support
|
||||
<application>ALTQ</application>, create a custom kernel using
|
||||
the instructions in <xref linkend="kernelconfig"/>. The
|
||||
following kernel options are available. The first is needed
|
||||
to enable <application>ALTQ</application>. At least one of
|
||||
the other options is necessary to specify the queueing
|
||||
scheduler algorithm:</para>
|
||||
|
||||
<programlisting>options ALTQ
|
||||
options ALTQ_CBQ # Class Based Queuing (CBQ)
|
||||
|
|
@ -382,56 +382,53 @@ options ALTQ_PRIQ # Priority Queuing (PRIQ)</programlisting>
|
|||
<varlistentry>
|
||||
<term>CBQ</term>
|
||||
<listitem>
|
||||
<para>Class Based Queuing
|
||||
(<acronym>CBQ</acronym>)
|
||||
is used to divide a connection's bandwidth into different
|
||||
classes or queues to prioritize traffic based on filter
|
||||
rules.</para>
|
||||
<para>Class Based Queuing (<acronym>CBQ</acronym>) is
|
||||
used to divide a connection's bandwidth into different
|
||||
classes or queues to prioritize traffic based on filter
|
||||
rules.</para>
|
||||
</listitem>
|
||||
</varlistentry>
|
||||
|
||||
<varlistentry>
|
||||
<term>RED</term>
|
||||
<listitem>
|
||||
<para>Random Early Detection
|
||||
(<acronym>RED</acronym>) is
|
||||
used to avoid network congestion by measuring the length of
|
||||
the queue and comparing it to the minimum and maximum
|
||||
thresholds for the queue. When the queue is over the maximum,
|
||||
all new packets are randomly dropped.</para>
|
||||
<para>Random Early Detection (<acronym>RED</acronym>) is
|
||||
used to avoid network congestion by measuring the length
|
||||
of the queue and comparing it to the minimum and maximum
|
||||
thresholds for the queue. When the queue is over the
|
||||
maximum, all new packets are randomly dropped.</para>
|
||||
</listitem>
|
||||
</varlistentry>
|
||||
|
||||
<varlistentry>
|
||||
<term>RIO</term>
|
||||
<listitem>
|
||||
<para>In Random Early Detection In and Out (<acronym>RIO</acronym>) mode,
|
||||
<acronym>RED</acronym> maintains multiple average queue
|
||||
lengths and multiple threshold values, one for each
|
||||
<acronym>QOS</acronym> level.</para>
|
||||
<para>In Random Early Detection In and Out
|
||||
(<acronym>RIO</acronym>) mode, <acronym>RED</acronym>
|
||||
maintains multiple average queue lengths and multiple
|
||||
threshold values, one for each
|
||||
<acronym>QOS</acronym> level.</para>
|
||||
</listitem>
|
||||
</varlistentry>
|
||||
|
||||
<varlistentry>
|
||||
<term>HFSC</term>
|
||||
<listitem>
|
||||
<para>Hierarchical Fair Service Curve Packet
|
||||
Scheduler (<acronym>HFSC</acronym>) is described in
|
||||
<uri
|
||||
xlink:href="http://www-2.cs.cmu.edu/~hzhang/HFSC/main.html">http://www-2.cs.cmu.edu/~hzhang/HFSC/main.html</uri>.</para>
|
||||
<para>Hierarchical Fair Service Curve Packet Scheduler
|
||||
(<acronym>HFSC</acronym>) is described in <uri
|
||||
xlink:href="http://www-2.cs.cmu.edu/~hzhang/HFSC/main.html">http://www-2.cs.cmu.edu/~hzhang/HFSC/main.html</uri>.</para>
|
||||
</listitem>
|
||||
</varlistentry>
|
||||
|
||||
<varlistentry>
|
||||
<term>PRIQ</term>
|
||||
<listitem>
|
||||
<para>Priority Queuing
|
||||
(<acronym>PRIQ</acronym>)
|
||||
always passes traffic that is in a higher queue first.</para>
|
||||
<para>Priority Queuing (<acronym>PRIQ</acronym>) always
|
||||
passes traffic that is in a higher queue first.</para>
|
||||
</listitem>
|
||||
</varlistentry>
|
||||
</variablelist>
|
||||
|
||||
|
||||
<para>More information about the scheduling
|
||||
algorithms and example rulesets are available at <uri
|
||||
xlink:href="http://www.openbsd.org/faq/pf/queueing.html">http://www.openbsd.org/faq/pf/queueing.html</uri>.</para>
|
||||
|
|
|
|||
Loading…
Reference in a new issue