[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <alpine.DEB.2.00.1204241113020.735@wel-95.cs.helsinki.fi>
Date: Tue, 24 Apr 2012 11:21:18 +0300 (EEST)
From: "Ilpo Järvinen" <ilpo.jarvinen@...sinki.fi>
To: David Miller <davem@...emloft.net>
cc: Eric Dumazet <eric.dumazet@...il.com>, rick.jones2@...com,
Netdev <netdev@...r.kernel.org>, therbert@...gle.com,
ncardwell@...gle.com, maze@...gle.com,
Yuchung Cheng <ycheng@...gle.com>
Subject: Re: [PATCH 2/2 net-next] tcp: sk_add_backlog() is too agressive for
TCP
On Tue, 24 Apr 2012, David Miller wrote:
> From: "Ilpo Järvinen" <ilpo.jarvinen@...sinki.fi>
> Date: Tue, 24 Apr 2012 11:01:37 +0300 (EEST)
>
> > Why not, but wouldn't it be nicer to coalesce them already in GRO below
> > with an assumption that GRO is likely to find some "mss" equivivalent
> > which tells the gap between consecutive ACK (or even SACK) seqnos?
>
> GRO must be able to precisely reproduce the input stream if the packet
> is forwarded and therefore we end up resegmenting on output with GSO.
I'm aware of this.
> That makes this a non-starter since we must therefore remember all of
> the SACK boundaries in the original packets.
GRO works because TCP tends to use rather constant MSS, right? ...Since
ACKs and SACKs are nothing more than reflection of those MSS boundaries of
the opposite direction I don't find that as impossible as you do because
the same kind of "mss" assumption can be applied there. But GRO has made
this somewhat messier now because the receiver doesn't any more generate
ACK per MSS or ACK per 2*MSS but that could be "fixed" by offloading the
ACK sending when responding to a GROed packet.
--
i.
Powered by blists - more mailing lists