Lines Matching +full:packet +full:- +full:based
1 # SPDX-License-Identifier: GPL-2.0-only
40 so-called IP spoofing, however it can pose problems if you use
42 than packets from that host to you) or if you operate a non-routing
52 <file:Documentation/networking/ip-sysctl.rst>.
68 Normally, a router decides what to do with a received packet based
69 solely on the packet's final destination address. If you say Y here,
70 the Linux router will also be able to take the packet's source
71 address into account. Furthermore, the TOS (Type-Of-Service) field
72 of the packet can be used for routing decisions as well.
85 a deterministic manner for a given packet. If you say Y here
86 however, it becomes possible to attach several actions to a packet
89 equal "cost" and chooses one of them in a non-deterministic fashion
90 if a matching packet arrives.
110 of the routing table during kernel boot, based on either information
132 <file:Documentation/admin-guide/nfs/nfsroot.rst> for details.
147 Read <file:Documentation/admin-guide/nfs/nfsroot.rst> for details.
160 <file:Documentation/admin-guide/nfs/nfsroot.rst> for details.
173 mobile-IP facilities (allowing laptops to seamlessly move between
238 what to do with a multicast packet based on the source and
240 will also be able to take interfaces and packet marks into
247 bool "IP: PIM-SM version 1 support"
253 (pimd-v1). Please see <http://netweb.usc.edu/pim/> for more
256 Say Y if you want to use PIM-SM v1. Note that you can say N here if
260 bool "IP: PIM-SM version 2 support"
265 gated-5). This routing protocol is not used widely, so say N unless
272 flooding". This denial-of-service attack prevents legitimate remote
411 RFC 6056 3.3.4. Algorithm 4: Double-Hash Port Selection Algorithm.
487 BIC-TCP is a sender-side only change that ensures a linear RTT
489 bounded TCP-friendliness. The protocol combines two schemes
501 This is version 2.0 of BIC-TCP which uses a cubic growth function
503 See http://www.csc.ncsu.edu/faculty/rhee/export/bitcp/cubic-paper.pdf
509 TCP Westwood+ is a sender-side only modification of the TCP Reno
511 control. It is based on end-to-end bandwidth estimation to set
520 tristate "H-TCP"
523 H-TCP is a send-side only modifications of the TCP Reno
527 based on network conditions and in a way so as to be fair with
528 other Reno and H-TCP flows.
541 tristate "TCP-Hybla congestion control algorithm"
544 TCP-Hybla is a sender-side only change that eliminates penalization of
545 long-RTT, large-bandwidth connections, like when satellite legs are
553 TCP Vegas is a sender-side only change to TCP that anticipates
556 window. TCP Vegas should provide less packet loss, but it is
570 when there is packet loss) due to fairness issues. One scenario when they
573 For further details see http://www.brakmo.org/networking/tcp-nv/
579 Scalable TCP is a sender-side only change to TCP which uses a
588 TCP Low Priority (TCP-LP), a distributed algorithm whose goal is
591 See http://www-ece.rice.edu/networks/TCP-LP/
597 TCP Veno is a sender-side only enhancement of TCP to obtain better
599 distinguishing to circumvent the difficult judgment of the packet loss
609 YeAH-TCP is a sender-side high-speed enabled TCP congestion control
622 TCP-Illinois is a sender-side modification of TCP Reno for
623 high speed long delay links. It uses round-trip-time to
635 provide multi-bit feedback to the end hosts. It is designed to provide:
637 - High burst tolerance (incast due to partition/aggregate),
638 - Low latency (short flows, queries),
639 - High throughput (continuous data updates, large file transfers) with
640 commodity, shallow-buffered switches.
649 http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf
652 tristate "CAIA Delay-Gradient (CDG)"
655 CAIA Delay-Gradient (CDG) is a TCP congestion control that modifies
660 o Coexist with flows that use loss-based congestion control.
661 o Tolerate packet loss unrelated to congestion.
674 model of the bottleneck delivery rate and path round-trip propagation
675 delay. It tolerates packet loss and delay unrelated to congestion. It
677 coexist with flows that use loss-based congestion control, and can
680 ("Fair Queue") pacing packet scheduler.