| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <CAK6E8=e9jpK1QY_zO5oSEC6oM+JgCG+bHcauDPdDOUqz7RSumQ@mail.gmail.com> Date: Mon, 28 Nov 2011 13:17:40 -0800 From: Yuchung Cheng <ycheng@...gle.com> To: "Esztermann, Ansgar" <Ansgar.Esztermann@...-bpc.mpg.de> Cc: "netdev@...r.kernel.org" <netdev@...r.kernel.org> Subject: Re: TCP fast retransmit Hi Ansgar, On Fri, Nov 25, 2011 at 5:33 AM, Esztermann, Ansgar <Ansgar.Esztermann@...-bpc.mpg.de> wrote: > [originally posted to lkml] > Hello list, > > is there some documentation available on TCP fast retransmit? There seem to be quite a lot of descriptions -- from informal to scholarly papers -- on the various algorithms available to calculate the proper size of the congestion window, but I have been unable so far to find out *when* a fast retransmit is triggered. RFC 2581 states the third dupACK "should" do it, and this seems to be quoted fairly often. However, I can easily produce connections that fail to perform fast retransmit even after 5 dupACKs. Some people mention Linux uses a different (presumable more sophisticated) algorithm to trigger fast retransmits, but no-one seems to elaborate. > This 2003 paper has the core algorithms for Linux loss recovery. http://www.cs.helsinki.fi/research/iwtcp/papers/linuxtcp.pdf We've also detailed latest Linux fast retransmit algorithms in the PRR paper (section 3.2). http://research.google.com/pubs/pub37486.html HTH -- To unsubscribe from this list: send the line "unsubscribe netdev" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists