On Friday 18 June 2004 13:12, pljosh wrote: > Użytkownik Abraham van der Merwe napisał: > > Hi! > > How does prioritization work when you've got a tree structure, e.g. > > > > +-- class_a rate 64kbit prio 1 > > > > | +-- class_a1 rate 32kbit prio 1 > > | > > | `-- class_a2 rate 32kbit prio 2 > > > > `-- class_b rate 64kbit prio 2 The prio of class class_a is never used and does not matter. > HTB means: __Hierarchical__ Token Bucket so it is more like this: > > (b) all packets matching a1, a2 are prio 1, then a1 is given a higher > > priority than a2 > > > > (iow, multiple layers of prioritization exist) > > But "prio" is used when there is some some unused BW that could be > splited for borrowing (for classes which have ceil higher than rate). Htb is used for 2 things: - class with lowest prio will get the lowest latancy (if and only if this class is not sending more data then the tate) - class will lowest prio will get the remaining bandwidth from the parent after each child class is sending his rate. Stef -- stef.coene@xxxxxxxxx "Using Linux as bandwidth manager" http://www.docum.org/ _______________________________________________ LARTC mailing list / LARTC@xxxxxxxxxxxxxxx http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
