old-www/HOWTO/Adv-Routing-HOWTO/lartc.adv-qdisc.csz.html

184 lines
3.4 KiB
HTML

<HTML
><HEAD
><TITLE
>Clark-Shenker-Zhang algorithm (CSZ)</TITLE
><META
NAME="GENERATOR"
CONTENT="Modular DocBook HTML Stylesheet Version 1.7"><LINK
REL="HOME"
TITLE="Linux Advanced Routing &#38; Traffic Control HOWTO"
HREF="index.html"><LINK
REL="UP"
TITLE="Advanced &#38; less common queueing disciplines"
HREF="lartc.adv-qdisc.html"><LINK
REL="PREVIOUS"
TITLE="bfifo/pfifo"
HREF="lartc.adv-qdisc.bfifo-pfifo.html"><LINK
REL="NEXT"
TITLE="DSMARK"
HREF="lartc.adv-qdisc.dsmark.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 &#38; Traffic Control HOWTO</TH
></TR
><TR
><TD
WIDTH="10%"
ALIGN="left"
VALIGN="bottom"
><A
HREF="lartc.adv-qdisc.bfifo-pfifo.html"
ACCESSKEY="P"
>Prev</A
></TD
><TD
WIDTH="80%"
ALIGN="center"
VALIGN="bottom"
>Chapter 14. Advanced &#38; less common queueing disciplines</TD
><TD
WIDTH="10%"
ALIGN="right"
VALIGN="bottom"
><A
HREF="lartc.adv-qdisc.dsmark.html"
ACCESSKEY="N"
>Next</A
></TD
></TR
></TABLE
><HR
ALIGN="LEFT"
WIDTH="100%"></DIV
><DIV
CLASS="SECT1"
><H1
CLASS="SECT1"
><A
NAME="LARTC.ADV-QDISC.CSZ"
></A
>14.2. Clark-Shenker-Zhang algorithm (CSZ)</H1
><P
>This is so theoretical that not even Alexey (the main CBQ author) claims to
understand it. From his source:</P
><A
NAME="AEN1640"
></A
><BLOCKQUOTE
CLASS="BLOCKQUOTE"
><P
>David D. Clark, Scott Shenker and Lixia Zhang
<I
CLASS="CITETITLE"
>Supporting Real-Time Applications in an Integrated Services Packet
Network: Architecture and Mechanism</I
>.</P
><P
>As I understand it, the main idea is to create WFQ flows for each guaranteed
service and to allocate the rest of bandwith to dummy flow-0. Flow-0
comprises the predictive services and the best effort traffic; it is handled
by a priority scheduler with the highest priority band allocated for
predictive services, and the rest --- to the best effort packets.</P
><P
>Note that in CSZ flows are NOT limited to their bandwidth. It is supposed
that the flow passed admission control at the edge of the QoS network and it
doesn't need further shaping. Any attempt to improve the flow or to shape it
to a token bucket at intermediate hops will introduce undesired delays and
raise jitter.</P
><P
>At the moment CSZ is the only scheduler that provides true guaranteed
service. Another schemes (including CBQ) do not provide guaranteed delay and
randomize jitter."</P
><P
>Does not currently seem like a good candidate to use, unless you've read and
understand the article mentioned.</P
></BLOCKQUOTE
></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.adv-qdisc.bfifo-pfifo.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.adv-qdisc.dsmark.html"
ACCESSKEY="N"
>Next</A
></TD
></TR
><TR
><TD
WIDTH="33%"
ALIGN="left"
VALIGN="top"
><TT
CLASS="LITERAL"
>bfifo</TT
>/<TT
CLASS="LITERAL"
>pfifo</TT
></TD
><TD
WIDTH="34%"
ALIGN="center"
VALIGN="top"
><A
HREF="lartc.adv-qdisc.html"
ACCESSKEY="U"
>Up</A
></TD
><TD
WIDTH="33%"
ALIGN="right"
VALIGN="top"
>DSMARK</TD
></TR
></TABLE
></DIV
></BODY
></HTML
>