| To: | "David S. Miller" <davem@xxxxxxxxxx> |
|---|---|
| Subject: | Re: Route cache performance under stress |
| From: | Robert Olsson <Robert.Olsson@xxxxxxxxxxx> |
| Date: | Tue, 10 Jun 2003 21:53:33 +0200 |
| Cc: | Robert.Olsson@xxxxxxxxxxx, ralph+d@xxxxxxxxx, ralph@xxxxxxxxx, hadi@xxxxxxxxxxxxxxxx, xerox@xxxxxxxxxx, sim@xxxxxxxxxxxxx, fw@xxxxxxxxxxxxx, netdev@xxxxxxxxxxx, linux-net@xxxxxxxxxxxxxxx |
| In-reply-to: | <20030610.115759.26513736.davem@redhat.com> |
| References: | <Pine.LNX.4.51.0306101332300.8755@ns.istop.com> <20030610.103234.116374169.davem@redhat.com> <16102.9418.43884.336925@robur.slu.se> <20030610.115759.26513736.davem@redhat.com> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
David S. Miller writes:
> How did you "rip it out"? Just never look into the routing
> cache hash and never add entries there? If so, then yes it is
> excellent simulation for pure slow path.
Look at the patch...
hash lookup is bypassed -> always slow path. no lookup in rt_intern_hash
but we keep the entry in the hash and ip_rt_dst_alloc is changed to run
do __rt_hash_shrink for each call.
> This is not purely an algorithmic problem. The highest cost thing we
> do in the slow path of input route processing is source validation.
> This requires real brains to eliminate.
>
> Actually, that's a good idea, if someone if brave just rip out
> fib_validate_source (just don't call it, should work for valid
> traffic) and see what happens :)
It should be easy to do...
Cheers.
--ro
|
| Previous by Date: | Re: 3c59x, David S. Miller |
|---|---|
| Next by Date: | [PATCH 2.5.70] net-sysfs parent ref count, Stephen Hemminger |
| Previous by Thread: | Re: Route cache performance under stress, David S. Miller |
| Next by Thread: | RE: Route cache performance under stress, CIT/Paul |
| Indexes: | [Date] [Thread] [Top] [All Lists] |