[Top] [All Lists]

Re: SFQ: Reordering?

To: Patrick McHardy <kaber@xxxxxxxxx>
Subject: Re: SFQ: Reordering?
From: Thomas Graf <tgraf@xxxxxxx>
Date: Sat, 7 May 2005 01:02:03 +0200
Cc: Asim Shankar <asimshankar@xxxxxxxxx>, netdev@xxxxxxxxxxx
In-reply-to: <427BF3C4.1030105@xxxxxxxxx>
References: <7bca1cb5050506145344d16b1e@xxxxxxxxxxxxxx> <427BEAAE.409@xxxxxxxxx> <427BF3C4.1030105@xxxxxxxxx>
Sender: netdev-bounce@xxxxxxxxxxx
* Patrick McHardy <427BF3C4.1030105@xxxxxxxxx> 2005-05-07 00:46
> Hmm wait, this is not so easy. We can't rehash by going over
> the buckets one by one. If we do so and we have a new clash of
> two flows previously contained in different buckets the packets
> will afterwards be sorted by flow in their new bucket. To retain
> fairness we need to iterate over all buckets containing packets
> and rehash them one packet per a bucket at a time. But this means
> we need lots of temporary storage to store the queues while
> rehashing. Can anyone thing of a better solution?

We can maintain a second hash table and switch a pointer over to the
new table but keep on dequeueing from the old one until it is empty.
Anyways, any such behaviour should be made optional via a rtnetlink

<Prev in Thread] Current Thread [Next in Thread>