•
http://www.docum.org/docum.org/docs/
Queue Types
Home menu level: /queue type
Description
In this submenu you can create your custom queue types. Afterwards, you will be able to use them
in /queue tree, /queue simple or /queue interface.
PFIFO and BFIFO
These queuing disciplines are based on the FIFO algorithm (First-In First-Out). The difference
between PFIFO and BFIFO is that one is measured in packets and the other one in bytes. There is
only one parameter called pfifo-limit (bfifo-limit) which defines how much data a FIFO queue can
hold. Every packet that cannot be enqueued (if the queue is full), is dropped. Large queue sizes can
increase latency.
Use FIFO queuing disciplines if you haven't a congested link
SFQ
Stochastic Fairness Queuing (SFQ) cannot limit traffic at all. Its main idea is to equalize traffic
flows (TCP sessions or UDP streams) when your link is completely full.
The fairness of SFQ is ensured by hashing and round-robin algorithms. Hashing algorithm divides
the session traffic over a limited number of subqueues. After sfq-perturb seconds the hashing
algorithm changes and divides the session traffic to other subqueues. The round-robin algorithm
dequeues pcq-allot bytes from each subqueue in a turn.
Page 426 of 695
Copyright 1999-2007, MikroTik. All rights reserved. Mikrotik, RouterOS and RouterBOARD are trademarks of Mikrotikls SIA.
Other trademarks and registred trademarks mentioned herein are properties of their respective owners.
