<HTML ><HEAD ><TITLE >bfifo/pfifo</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="Advanced & less common queueing disciplines" HREF="lartc.adv-qdisc.html"><LINK REL="PREVIOUS" TITLE="Advanced & less common queueing disciplines" HREF="lartc.adv-qdisc.html"><LINK REL="NEXT" TITLE="Clark-Shenker-Zhang algorithm (CSZ)" HREF="lartc.adv-qdisc.csz.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.adv-qdisc.html" ACCESSKEY="P" >Prev</A ></TD ><TD WIDTH="80%" ALIGN="center" VALIGN="bottom" >Chapter 14. Advanced & less common queueing disciplines</TD ><TD WIDTH="10%" ALIGN="right" VALIGN="bottom" ><A HREF="lartc.adv-qdisc.csz.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.BFIFO-PFIFO" ></A >14.1. <TT CLASS="LITERAL" >bfifo</TT >/<TT CLASS="LITERAL" >pfifo</TT ></H1 ><P >These classless queues are even simpler than pfifo_fast in that they lack the internal bands - all traffic is really equal. They have one important benefit though, they have some statistics. So even if you don't need shaping or prioritizing, you can use this qdisc to determine the backlog on your interface.</P ><P >pfifo has a length measured in packets, bfifo in bytes. </P ><DIV CLASS="SECT2" ><H2 CLASS="SECT2" ><A NAME="AEN1629" ></A >14.1.1. Parameters & usage</H2 ><P ><P ></P ><DIV CLASS="VARIABLELIST" ><DL ><DT >limit</DT ><DD ><P >Specifies the length of the queue. Measured in bytes for bfifo, in packets for pfifo. Defaults to the interface txqueuelen (see pfifo_fast chapter) packets long or txqueuelen*mtu bytes for bfifo.</P ></DD ></DL ></DIV ></P ></DIV ></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.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.csz.html" ACCESSKEY="N" >Next</A ></TD ></TR ><TR ><TD WIDTH="33%" ALIGN="left" VALIGN="top" >Advanced & less common queueing disciplines</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" >Clark-Shenker-Zhang algorithm (CSZ)</TD ></TR ></TABLE ></DIV ></BODY ></HTML >