Skip site navigation (1)Skip section navigation (2)
Date:      Wed, 14 Aug 2013 14:05:51 +0200
From:      Luigi Rizzo <rizzo@iet.unipi.it>
To:        Lev Serebryakov <lev@FreeBSD.org>
Cc:        Lawrence Stewart <lstewart@freebsd.org>, FreeBSD Net <net@freebsd.org>
Subject:   route/arp lifetime (Re: it's the output, not ack coalescing (Re: TSO and FreeBSD vs Linux))
Message-ID:  <20130814120551.GA64260@onelab2.iet.unipi.it>
In-Reply-To: <587579055.20130814154713@serebryakov.spb.ru>
References:  <520A6D07.5080106@freebsd.org> <520AFBE8.1090109@freebsd.org> <520B24A0.4000706@freebsd.org> <520B3056.1000804@freebsd.org> <20130814102109.GA63246@onelab2.iet.unipi.it> <587579055.20130814154713@serebryakov.spb.ru>

next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, Aug 14, 2013 at 03:47:13PM +0400, Lev Serebryakov wrote:
> Hello, Luigi.
> You wrote 14 ?????????????? 2013 ??., 14:21:09:
> 
> LR> Then the problem remains that we should keep a copy of route and
> LR> arp information in the socket instead of redoing the lookups on
> LR> every single transmission, as they consume some 25% of the time of
> LR> a sendto(), and probably even more when it comes to large tcp
> LR> segments, sendfile() and the like.

>   And we should invalidate this info on ARP/route changes, or connection
>  will be lost in such cases, am I right?.. So, on each such event code
>  should look into all sockets and check, if routing/ARP information is still
>  valid for them. Or we should store lists of sockets in routing and ARP
>  tables... I don't know, what is worse.

I think we should start by acknowledging that routing and ARP
information is inherently stale, and changes unfrequently.
So it is not a disaster if we have incorrect information for some
short amount of time (milliseconds) because in the end the remote
party that decides to change it and inform us may take much longer
than that to distribute the update.


Considering that each lookup takes between 100..300ns if you are
lucky (not many misses, relatively empty table etc.), one could
reasonably do the lookup at most once per millisecond or so (just
reading 'ticks', no need for a nanotime() if you have a slow clock),
or whenever we get an error related to the socket, either in the
forward path (e.g. ifp points to an interface that is down) or in
the reverse path (e.g. a dupack because we sent a packet to the
wrong place).

cheers
luigi



Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20130814120551.GA64260>