From mboxrd@z Thu Jan  1 00:00:00 1970
From: Dimitris Kotsonis <dkotsonis@gmail.com>
Date: Thu, 07 Aug 2014 14:41:27 +0000
Subject: Re: SFQ + speed caps
Message-Id: <53E39017.6000208@gmail.com>
List-Id: <lartc.vger.kernel.org>
References: <53E1EE68.8030503@gmail.com>
In-Reply-To: <53E1EE68.8030503@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
To: lartc@vger.kernel.org

On 8/7/2014 3:42 PM, Remy Mudingay wrote:
> HI Dimitris,
>
> The solution is straight forward :
>
> interface
>   |
>   +---- HTB --- class 1 parent class
>          |
>          +----- HTB class 2  (everything else) 90% guaranteed/ 100% cap
>          |        |
>          |       +--- SFQ
>          |
>          +----- HTB class 3 (capped pc) 10% guaranteed/ 20% cap
>

Hi Remy,

 From what I can tell what you posted is identical to the hypothetical 
scenario that I said will not work.

Here is the problem with it. Let's say that there are 20 pcs battling 
for bandwidth in class 2. SFQ will guarantee that each will get 
approximately 1/20th of the bandwidth. The capped pc however is 
unfettered by the SFQ round robin so it can potentially consume the 
entire chunk allocated to it by HTB in class 3, which is more than 1/20. 
So the capped pc can potentially (e.g. using a large number of sockets) 
get more bandwidth than the uncapped pcs.

So what I am looking for is for a way to implement a global SFQ instead 
of one for each HTB class. For a way to place the entire HTB logic on 
top of a single SFQ.

Regards,

Dimitris