diff options
| author | David S. Miller <davem@davemloft.net> | 2019-06-17 20:39:56 +0300 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2019-06-17 20:39:56 +0300 |
| commit | 4fddbf8a99ee5a65bdd31b3ebbf5a84b9395d496 (patch) | |
| tree | 671cdce9ff92bdd0a99619f995bbcea9124735ad /Documentation | |
| parent | 6be8e297f9bcea666ea85ac7a6cd9d52d6deaf92 (diff) | |
| parent | 967c05aee439e6e5d7d805e195b3a20ef5c433d6 (diff) | |
| download | linux-4fddbf8a99ee5a65bdd31b3ebbf5a84b9395d496.tar.xz | |
Merge branch 'tcp-fixes'
Eric Dumazet says:
====================
tcp: make sack processing more robust
Jonathan Looney brought to our attention multiple problems
in TCP stack at the sender side.
SACK processing can be abused by malicious peers to either
cause overflows, or increase of memory usage.
First two patches fix the immediate problems.
Since the malicious peers abuse senders by advertizing a very
small MSS in their SYN or SYNACK packet, the last two
patches add a new sysctl so that admins can chose a higher
limit for MSS clamping.
====================
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'Documentation')
| -rw-r--r-- | Documentation/networking/ip-sysctl.txt | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/Documentation/networking/ip-sysctl.txt b/Documentation/networking/ip-sysctl.txt index 288aa264ac26..22f6b8b1110a 100644 --- a/Documentation/networking/ip-sysctl.txt +++ b/Documentation/networking/ip-sysctl.txt @@ -255,6 +255,14 @@ tcp_base_mss - INTEGER Path MTU discovery (MTU probing). If MTU probing is enabled, this is the initial MSS used by the connection. +tcp_min_snd_mss - INTEGER + TCP SYN and SYNACK messages usually advertise an ADVMSS option, + as described in RFC 1122 and RFC 6691. + If this ADVMSS option is smaller than tcp_min_snd_mss, + it is silently capped to tcp_min_snd_mss. + + Default : 48 (at least 8 bytes of payload per segment) + tcp_congestion_control - STRING Set the congestion control algorithm to be used for new connections. The algorithm "reno" is always available, but |