Manual:HTB

Theory

Structure

Hierarchical Token Bucket (HTB) allows to create hierarchical queue structure and determine relations between parent and child queues and relation between child queues. As soon as queue have at least one child it become a parent queue. All child queues (don't matter how many levels of parents they have) are treated as they were on the same (bottom) level of HTB. Child queues make actual traffic consumption, parent queues are responsible only for traffic distribution. Child queues are not able to get more traffic than parent has.

In RouterOS it is necessary to specify parent option to assign queue as a child to other queue

Each queue in HTB have two rate limits:

• CIR (Committed Information Rate) – (limit-at in RouterOS)in worst case scenario flow will get this amount of traffic no matter what (assuming we can actually send so much data)
• MIR (Maximal Information Rate) – in best case scenario a flow can get up to max-limit if there is spare bandwidth

In another words, at first HTB will try to satisfy every child queue's limit-at (CIR) only then it will try to reach max-limit (MIR) To ensure optimal usage of HTB features we suggest to stick to these rules:

• Maximal rate of the parent must be equal or bigger than sum of committed rates of the children

MIR (parent) ≥ CIR(child1) +...+ CIR(childN)

• Maximal rate of any child must be less or equal to maximal rate of the parent

MIR (parent) ≥ MIR(child1) & MIR (parent) ≥ MIR(child2) & MIR (parent) ≥ MIR(childN)

(likumi par limit-at un max-limit)

Example: Stage 1

File:Stage1 1.jpg

Example: Stage 2

File:Stage1 2.jpg

Example: Stage 3