Community discussions

MikroTik App
 
User avatar
dwright
Member Candidate
Member Candidate
Topic Author
Posts: 158
Joined: Fri May 28, 2004 1:10 pm
Location: Mchenry, Il

Queue Tree: Priority with Multiple Classes w/Children

Fri Dec 09, 2005 8:46 pm

I have a question that I hope can be answered. In the documentation on HTB they show an example where there are multiple leafs with multiple parent classes.

Image

Refering to the picture, what if there was multiple classes in level one that each had leafs.

Lets say for example in level one I had two classes that had different priorites, and then each class had leafs with there own priorities. If two leafs from different classes turned yellow, had the same priority and moved up one level, who would have priority? The leaf that came from the class with the higher priority?

If the both classes turned yellow and moved up, who would have priority?

Or is it impossible to have multiple classes with there own leafs?

Dan
 
User avatar
dwright
Member Candidate
Member Candidate
Topic Author
Posts: 158
Joined: Fri May 28, 2004 1:10 pm
Location: Mchenry, Il

Sat Dec 10, 2005 12:19 am

Figured it out. From the documentation for those also interested.

Priorities

When a leaf class wants to send some traffic (as they are the only classes that hold packets), HTB checks its priority. It will begin with the highest priority and the lowest level and proceed until the lowest priority at highest level is reached:

Image

As you can see from the picture, leaf-classes which are at the green state, will always have a higher priority than those which are borrowing because their priority is at a lower level (level0). In this picture, Leaf1 will be served only after Leaf2, although it has a higher priority (7) than Leaf1 (8).

In case of equal priorities and equal states, HTB serves these classes, using round robin algorithm.
Dan