David Burgess wrote: > On Wed, Jul 28, 2010 at 2:50 PM, Darryl Miles > <[email protected]> wrote: >> TBF works by deliberately >> delaying the packets as they pass through the device by tiny amounts >> this makes the sender and receiver think the maximum throughput across >> the network is lower than it really is. > > Well, no. At least not according to http://lartc.org/lartc.html > (9.2.2). It should however serve the troubleshooting purpose you > mentioned, just not by the mechanism that you described, at least not > to my understanding.
I don't understand the relevance of your citation as an argument against anything I've said. What is your understanding of the mechanism I described and what is your understanding of section (9.2.2) in relation to that ? I can find nothing in 9.2.2 that contradicts anything I have said so far. While section 9.2.2 goes into the specifics of how TBF is implemented in Linux, it doesn't explain what its purpose is; nor does section 9.2.2 explain what the observable effect at the sender/receiver is. It is somewhat presumed by LARTC that a user wishing to enable those advanced kernel features is familiar with the terminology and purpose. Maybe the wiki page http://en.wikipedia.org/wiki/Token_bucket would be more useful at explaining the general concept in the context of using it to "rate limit" throughput so that the router device is never stressed. Which is the topic of this thread. Darryl _______________________________________________ Soekris-tech mailing list [email protected] http://lists.soekris.com/mailman/listinfo/soekris-tech
