Bonjour,
Je termine la traduction de la dernière version de cet HOWTO. Je n'arrive pas à trouver de traductions satisfaisantes pour certains passages que je vous soumet :
* Size of the bucket, in bytes. This is the maximum amount of bytes that tokens can be available for instantaneously. In general, larger shaping rates require a larger buffer. For 10mbit/s on Intel, you need at least 10kbyte buffer if you want to reach your configured rate! If your buffer is too small, packets may be dropped because more tokens arrive per timer tick than fit in your bucket.
* Classification can be performed using filters. A filter contains a number of conditions which if matched, make the filter match.
* When the kernel decides that it needs to extract packets to send to the interface, the root qdisc 1: gets a dequeue request, which is passed to 1:1, which is in turn passed to 10:, 11: and 12:, which each query their siblings, and try to dequeue() from them. In this case, the kernel needs to walk the entire tree, because only 12:2 contains a packet.
* As mentioned before, CBQ needs to throttle in case of overlimit. The ideal solution is to do so for exactly the calculated idle time, and pass 1 packet. However, Unix kernels generally have a hard time scheduling events shorter than 10ms, so it is better to throttle for a longer period, and then pass minburst packets in one go, and then sleep minburst times longer. The time to wait is called the offtime. Higher values of minburst lead to more accurate shaping in the long term, but to bigger bursts at millisecond timescales.
* As your HTB configuration gets more complex, your configuration scales well. With CBQ it is already complex even in simple cases!
Je sais que le texte est un peu long, mais je vous demande un peu d'indulgence !!
Merci de votre aide,
Laurent Foucher