Thanks very much, Devik and Andy, I had seminar today and I think it has some
success, and (for now?) I do not feel like having unanswered questions.
Dmitry
On Sunday 13 June 2004 21:41, Martin Devera [EMAIL PROTECTED] wrote:
1. In order of priority, we satisfy all leaf classes' rates (while
Dmitry Golubev wrote:
snip
One think I do not understand neither for SFQ nor for HTB (please explain for
both) - how can we maintain fairness in case of differently-sizes packets. As
I understand, one packet is atomic unit, and interface is requesting not more
and not less than one packet.
I
1. In order of priority, we satisfy all leaf classes' rates (while the class
is ?green?)
2. When the leaf classes' rate is reached (all the leaf classes are ?yellow?),
borrow the unused speed from parent classes if they have something to give
(if they are not ?red?). In this case, each leaf
Hello,
I have been searching for HTB theory documentation and found two interesting
sources - Devik's page and docum.org FAQ. In some places they are
contradictory which make me think that Devik's theoretic document (marked
actual) is just too old and does not reflect the latest changes. After
On Saturday 12 June 2004 13:46, Dmitry Golubev wrote:
Hello,
I have been searching for HTB theory documentation and found two
interesting sources - Devik's page and docum.org FAQ. In some places they
are
contradictory which make me think that Devik's theoretic document (marked
actual) is
OK then, could you tell if I understand correctly and correct me if not?
1. In order of priority, we satisfy all leaf classes' rates (while the class
is green)
2. When the leaf classes' rate is reached (all the leaf classes are yellow),
borrow the unused speed from parent classes if they have
