* [LARTC] priorities + htb
@ 2004-06-18 8:54 Abraham van der Merwe
2004-06-18 9:40 ` Ed Wildgoose
` (2 more replies)
0 siblings, 3 replies; 4+ messages in thread
From: Abraham van der Merwe @ 2004-06-18 8:54 UTC (permalink / raw)
To: lartc
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
Above could either be interpreted as
(a) a, a1 have prio 1
b, a2 have prio 2
(iow, no distinction is being made between the inner/nested classes and
the outer/parent classes)
OR
(b) all packets matching a1, a2 are prio 1, then a1 is given a higher
priority than a2
(iow, multiple layers of prioritization exist)
--
Regards
Abraham
TODAY the Pond!
TOMORROW the World!
-- Frogs (1972)
___________________________________________________
Abraham vd Merwe - Frogfoot Networks CC
1st Floor, Albion Springs, 183 Main Road, Newlands
Phone: +27 21 689 3876 Cell: +27 82 565 4451
Http: http://www.frogfoot.net/ Email: abz@frogfoot.net
_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
^ permalink raw reply [flat|nested] 4+ messages in thread* Re: [LARTC] priorities + htb
2004-06-18 8:54 [LARTC] priorities + htb Abraham van der Merwe
@ 2004-06-18 9:40 ` Ed Wildgoose
2004-06-18 11:12 ` pljosh
2004-06-19 20:36 ` Stef Coene
2 siblings, 0 replies; 4+ messages in thread
From: Ed Wildgoose @ 2004-06-18 9:40 UTC (permalink / raw)
To: lartc
Abraham van der Merwe wrote:
>Hi!
>
>How does prioritization work when you've got a tree structure, e.g.
>
>
>
I think the whole idea of linux QOS is that it dequeues up the tree
until it reaches the net interface. So effectively I think you evaluate
each leaf in turn on the way up the tree
If for example you have some queue which gives 50:50, and below one leaf
you add another queue which gives 50:50 then I think those bottom leaves
are getting 1/4 each.
I'm sure Andy or someone else will correct me if I'm wrong, but I think
this is how you evaluate the whole QOS tree to see what will happen?
Ed W
_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: [LARTC] priorities + htb
2004-06-18 8:54 [LARTC] priorities + htb Abraham van der Merwe
2004-06-18 9:40 ` Ed Wildgoose
@ 2004-06-18 11:12 ` pljosh
2004-06-19 20:36 ` Stef Coene
2 siblings, 0 replies; 4+ messages in thread
From: pljosh @ 2004-06-18 11:12 UTC (permalink / raw)
To: lartc
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
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).
-josh
_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: [LARTC] priorities + htb
2004-06-18 8:54 [LARTC] priorities + htb Abraham van der Merwe
2004-06-18 9:40 ` Ed Wildgoose
2004-06-18 11:12 ` pljosh
@ 2004-06-19 20:36 ` Stef Coene
2 siblings, 0 replies; 4+ messages in thread
From: Stef Coene @ 2004-06-19 20:36 UTC (permalink / raw)
To: lartc
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@docum.org
"Using Linux as bandwidth manager"
http://www.docum.org/
_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
^ permalink raw reply [flat|nested] 4+ messages in thread
end of thread, other threads:[~2004-06-19 20:36 UTC | newest]
Thread overview: 4+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2004-06-18 8:54 [LARTC] priorities + htb Abraham van der Merwe
2004-06-18 9:40 ` Ed Wildgoose
2004-06-18 11:12 ` pljosh
2004-06-19 20:36 ` Stef Coene
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.