Scribd
Upload
78 views1 page

Chapter 14. Advanced & Less Common Queueing Disciplines: Bfifo Pfifo

This document discusses some less common queueing disciplines in the Linux kernel that can be used if the more standard queues do not meet needs. It describes bfifo and pfifo queues, which are simpler than pfifo_fast as they lack internal bands and treat all traffic equally, but provide statistics on backlog. The pfifo queue length is measured in packets and bfifo in bytes. Both accept a "limit" parameter to specify the queue length.

Uploaded by

ombidasar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
78 views1 page

Chapter 14. Advanced & Less Common Queueing Disciplines: Bfifo Pfifo

This document discusses some less common queueing disciplines in the Linux kernel that can be used if the more standard queues do not meet needs. It describes bfifo and pfifo queues, which are simpler than pfifo_fast as they lack internal bands and treat all traffic equally, but provide statistics on backlog. The pfifo queue length is measured in packets and bfifo in bytes. Both accept a "limit" parameter to specify the queue length.

Uploaded by

ombidasar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

2/17/13

Advanced & less common queueing disciplines

Made possible by PowerDNS Prev Next

Chapter 14. Advanced & less common queueing disciplines


Should you find that you have needs not addressed by the queues mentioned earlier, the kernel contains some other more specialized queues mentioned here.

14.1. b f i f o /p f i f o
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. pfifo has a length measured in packets, bfifo in bytes.

14.1.1. Parameters & usage


limit 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. Prev Obscure settings Home Next Clark-Shenker-Zhang algorithm (CSZ)

lartc.org/howto/lartc.adv-qdisc.html

1/1

You might also like