203 lines
3.8 KiB
HTML
203 lines
3.8 KiB
HTML
<HTML
|
|
><HEAD
|
|
><TITLE
|
|
>Advice for when to use which queue</TITLE
|
|
><META
|
|
NAME="GENERATOR"
|
|
CONTENT="Modular DocBook HTML Stylesheet Version 1.7"><LINK
|
|
REL="HOME"
|
|
TITLE="Linux Advanced Routing & Traffic Control HOWTO"
|
|
HREF="index.html"><LINK
|
|
REL="UP"
|
|
TITLE="Queueing Disciplines for Bandwidth Management"
|
|
HREF="lartc.qdisc.html"><LINK
|
|
REL="PREVIOUS"
|
|
TITLE="Simple, classless Queueing Disciplines"
|
|
HREF="lartc.qdisc.classless.html"><LINK
|
|
REL="NEXT"
|
|
TITLE="Terminology"
|
|
HREF="lartc.qdisc.terminology.html"></HEAD
|
|
><BODY
|
|
CLASS="SECT1"
|
|
BGCOLOR="#FFFFFF"
|
|
TEXT="#000000"
|
|
LINK="#0000FF"
|
|
VLINK="#840084"
|
|
ALINK="#0000FF"
|
|
><DIV
|
|
CLASS="NAVHEADER"
|
|
><TABLE
|
|
SUMMARY="Header navigation table"
|
|
WIDTH="100%"
|
|
BORDER="0"
|
|
CELLPADDING="0"
|
|
CELLSPACING="0"
|
|
><TR
|
|
><TH
|
|
COLSPAN="3"
|
|
ALIGN="center"
|
|
>Linux Advanced Routing & Traffic Control HOWTO</TH
|
|
></TR
|
|
><TR
|
|
><TD
|
|
WIDTH="10%"
|
|
ALIGN="left"
|
|
VALIGN="bottom"
|
|
><A
|
|
HREF="lartc.qdisc.classless.html"
|
|
ACCESSKEY="P"
|
|
>Prev</A
|
|
></TD
|
|
><TD
|
|
WIDTH="80%"
|
|
ALIGN="center"
|
|
VALIGN="bottom"
|
|
>Chapter 9. Queueing Disciplines for Bandwidth Management</TD
|
|
><TD
|
|
WIDTH="10%"
|
|
ALIGN="right"
|
|
VALIGN="bottom"
|
|
><A
|
|
HREF="lartc.qdisc.terminology.html"
|
|
ACCESSKEY="N"
|
|
>Next</A
|
|
></TD
|
|
></TR
|
|
></TABLE
|
|
><HR
|
|
ALIGN="LEFT"
|
|
WIDTH="100%"></DIV
|
|
><DIV
|
|
CLASS="SECT1"
|
|
><H1
|
|
CLASS="SECT1"
|
|
><A
|
|
NAME="LARTC.QDISC.ADVICE"
|
|
></A
|
|
>9.3. Advice for when to use which queue</H1
|
|
><P
|
|
>Summarizing, these are the simple queues that actually manage traffic by
|
|
reordering, slowing or dropping packets.</P
|
|
><P
|
|
>The following tips may help in choosing which queue to use. It mentions some
|
|
qdiscs described in the
|
|
<I
|
|
CLASS="CITETITLE"
|
|
><A
|
|
HREF="lartc.adv-qdisc.html"
|
|
>Chapter 14</A
|
|
></I
|
|
> chapter.</P
|
|
><P
|
|
></P
|
|
><UL
|
|
><LI
|
|
><P
|
|
>To purely slow down outgoing traffic, use the Token Bucket Filter. Works up
|
|
to huge bandwidths, if you scale the bucket.</P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>If your link is truly full and you want to make sure that no single session
|
|
can dominate your outgoing bandwidth, use Stochastical Fairness Queueing.</P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>If you have a big backbone and know what you are doing, consider Random
|
|
Early Drop (see Advanced chapter).</P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>To 'shape' incoming traffic which you are not forwarding, use the Ingress
|
|
Policer. Incoming shaping is called 'policing', by the way, not 'shaping'. </P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>If you *are* forwarding it, use a TBF on the interface you are forwarding
|
|
the data to. Unless you want to shape traffic that may go out over several
|
|
interfaces, in which case the only common factor is the incoming interface.
|
|
In that case use the Ingress Policer.</P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>If you don't want to shape, but only want to see if your interface is so
|
|
loaded that it has to queue, use the pfifo queue (not pfifo_fast). It lacks
|
|
internal bands but does account the size of its backlog.</P
|
|
></LI
|
|
><LI
|
|
><P
|
|
>Finally - you can also do <SPAN
|
|
CLASS="QUOTE"
|
|
>"social shaping"</SPAN
|
|
>.
|
|
You may not always be able to use technology to achieve what you want.
|
|
Users experience technical constraints as hostile.
|
|
A kind word may also help with getting your bandwidth to be divided right!</P
|
|
></LI
|
|
></UL
|
|
></DIV
|
|
><DIV
|
|
CLASS="NAVFOOTER"
|
|
><HR
|
|
ALIGN="LEFT"
|
|
WIDTH="100%"><TABLE
|
|
SUMMARY="Footer navigation table"
|
|
WIDTH="100%"
|
|
BORDER="0"
|
|
CELLPADDING="0"
|
|
CELLSPACING="0"
|
|
><TR
|
|
><TD
|
|
WIDTH="33%"
|
|
ALIGN="left"
|
|
VALIGN="top"
|
|
><A
|
|
HREF="lartc.qdisc.classless.html"
|
|
ACCESSKEY="P"
|
|
>Prev</A
|
|
></TD
|
|
><TD
|
|
WIDTH="34%"
|
|
ALIGN="center"
|
|
VALIGN="top"
|
|
><A
|
|
HREF="index.html"
|
|
ACCESSKEY="H"
|
|
>Home</A
|
|
></TD
|
|
><TD
|
|
WIDTH="33%"
|
|
ALIGN="right"
|
|
VALIGN="top"
|
|
><A
|
|
HREF="lartc.qdisc.terminology.html"
|
|
ACCESSKEY="N"
|
|
>Next</A
|
|
></TD
|
|
></TR
|
|
><TR
|
|
><TD
|
|
WIDTH="33%"
|
|
ALIGN="left"
|
|
VALIGN="top"
|
|
>Simple, classless Queueing Disciplines</TD
|
|
><TD
|
|
WIDTH="34%"
|
|
ALIGN="center"
|
|
VALIGN="top"
|
|
><A
|
|
HREF="lartc.qdisc.html"
|
|
ACCESSKEY="U"
|
|
>Up</A
|
|
></TD
|
|
><TD
|
|
WIDTH="33%"
|
|
ALIGN="right"
|
|
VALIGN="top"
|
|
>Terminology</TD
|
|
></TR
|
|
></TABLE
|
|
></DIV
|
|
></BODY
|
|
></HTML
|
|
> |