2 # Traffic control configuration.
6 bool "QoS and/or fair queueing"
9 When the kernel has several packets to send out over a network
10 device, it has to decide which ones to send first, which ones to
11 delay, and which ones to drop. This is the job of the queueing
12 disciplines, several different algorithms for how to do this
13 "fairly" have been proposed.
15 If you say N here, you will get the standard packet scheduler, which
16 is a FIFO (first come, first served). If you say Y here, you will be
17 able to choose from among several alternative algorithms which can
18 then be attached to different network devices. This is useful for
19 example if some of your network devices are real time devices that
20 need a certain minimum data flow rate, or if you need to limit the
21 maximum data flow rate for traffic which matches specified criteria.
22 This code is considered to be experimental.
24 To administer these schedulers, you'll need the user-level utilities
25 from the package iproute2+tc at
26 <https://www.kernel.org/pub/linux/utils/net/iproute2/>. That package
27 also contains some documentation; for more, check out
28 <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
32 (RSVP) on your Linux router if you also say Y to the corresponding
33 classifiers below. Documentation and software is at
34 <http://diffserv.sourceforge.net/>.
36 If you say Y here and to "/proc file system" below, you will be able
37 to read status information about packet schedulers from the file
40 The available schedulers are listed in the following questions; you
41 can say Y to as many as you like. If unsure, say N now.
45 comment "Queueing/Scheduling"
48 tristate "Class Based Queueing (CBQ)"
50 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
51 scheduling algorithm. This algorithm classifies the waiting packets
52 into a tree-like hierarchy of classes; the leaves of this tree are
53 in turn scheduled by separate algorithms.
55 See the top of <file:net/sched/sch_cbq.c> for more details.
57 CBQ is a commonly used scheduler, so if you're unsure, you should
58 say Y here. Then say Y to all the queueing algorithms below that you
59 want to use as leaf disciplines.
61 To compile this code as a module, choose M here: the
62 module will be called sch_cbq.
65 tristate "Hierarchical Token Bucket (HTB)"
67 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
68 packet scheduling algorithm. See
69 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
72 HTB is very similar to CBQ regarding its goals however is has
73 different properties and different algorithm.
75 To compile this code as a module, choose M here: the
76 module will be called sch_htb.
79 tristate "Hierarchical Fair Service Curve (HFSC)"
81 Say Y here if you want to use the Hierarchical Fair Service Curve
82 (HFSC) packet scheduling algorithm.
84 To compile this code as a module, choose M here: the
85 module will be called sch_hfsc.
88 tristate "ATM Virtual Circuits (ATM)"
91 Say Y here if you want to use the ATM pseudo-scheduler. This
92 provides a framework for invoking classifiers, which in turn
93 select classes of this queuing discipline. Each class maps
94 the flow(s) it is handling to a given virtual circuit.
96 See the top of <file:net/sched/sch_atm.c> for more details.
98 To compile this code as a module, choose M here: the
99 module will be called sch_atm.
102 tristate "Multi Band Priority Queueing (PRIO)"
104 Say Y here if you want to use an n-band priority queue packet
107 To compile this code as a module, choose M here: the
108 module will be called sch_prio.
110 config NET_SCH_MULTIQ
111 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
113 Say Y here if you want to use an n-band queue packet scheduler
114 to support devices that have multiple hardware transmit queues.
116 To compile this code as a module, choose M here: the
117 module will be called sch_multiq.
120 tristate "Random Early Detection (RED)"
122 Say Y here if you want to use the Random Early Detection (RED)
123 packet scheduling algorithm.
125 See the top of <file:net/sched/sch_red.c> for more details.
127 To compile this code as a module, choose M here: the
128 module will be called sch_red.
131 tristate "Stochastic Fair Blue (SFB)"
133 Say Y here if you want to use the Stochastic Fair Blue (SFB)
134 packet scheduling algorithm.
136 See the top of <file:net/sched/sch_sfb.c> for more details.
138 To compile this code as a module, choose M here: the
139 module will be called sch_sfb.
142 tristate "Stochastic Fairness Queueing (SFQ)"
144 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
145 packet scheduling algorithm.
147 See the top of <file:net/sched/sch_sfq.c> for more details.
149 To compile this code as a module, choose M here: the
150 module will be called sch_sfq.
153 tristate "True Link Equalizer (TEQL)"
155 Say Y here if you want to use the True Link Equalizer (TLE) packet
156 scheduling algorithm. This queueing discipline allows the combination
157 of several physical devices into one virtual device.
159 See the top of <file:net/sched/sch_teql.c> for more details.
161 To compile this code as a module, choose M here: the
162 module will be called sch_teql.
165 tristate "Token Bucket Filter (TBF)"
167 Say Y here if you want to use the Token Bucket Filter (TBF) packet
168 scheduling algorithm.
170 See the top of <file:net/sched/sch_tbf.c> for more details.
172 To compile this code as a module, choose M here: the
173 module will be called sch_tbf.
176 tristate "Credit Based Shaper (CBS)"
178 Say Y here if you want to use the Credit Based Shaper (CBS) packet
179 scheduling algorithm.
181 See the top of <file:net/sched/sch_cbs.c> for more details.
183 To compile this code as a module, choose M here: the
184 module will be called sch_cbs.
187 tristate "Earliest TxTime First (ETF)"
189 Say Y here if you want to use the Earliest TxTime First (ETF) packet
190 scheduling algorithm.
192 See the top of <file:net/sched/sch_etf.c> for more details.
194 To compile this code as a module, choose M here: the
195 module will be called sch_etf.
198 tristate "Generic Random Early Detection (GRED)"
200 Say Y here if you want to use the Generic Random Early Detection
201 (GRED) packet scheduling algorithm for some of your network devices
202 (see the top of <file:net/sched/sch_red.c> for details and
203 references about the algorithm).
205 To compile this code as a module, choose M here: the
206 module will be called sch_gred.
208 config NET_SCH_DSMARK
209 tristate "Differentiated Services marker (DSMARK)"
211 Say Y if you want to schedule packets according to the
212 Differentiated Services architecture proposed in RFC 2475.
213 Technical information on this method, with pointers to associated
214 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
216 To compile this code as a module, choose M here: the
217 module will be called sch_dsmark.
220 tristate "Network emulator (NETEM)"
222 Say Y if you want to emulate network delay, loss, and packet
223 re-ordering. This is often useful to simulate networks when
224 testing applications or protocols.
226 To compile this driver as a module, choose M here: the module
227 will be called sch_netem.
232 tristate "Deficit Round Robin scheduler (DRR)"
234 Say Y here if you want to use the Deficit Round Robin (DRR) packet
235 scheduling algorithm.
237 To compile this driver as a module, choose M here: the module
238 will be called sch_drr.
242 config NET_SCH_MQPRIO
243 tristate "Multi-queue priority scheduler (MQPRIO)"
245 Say Y here if you want to use the Multi-queue Priority scheduler.
246 This scheduler allows QOS to be offloaded on NICs that have support
247 for offloading QOS schedulers.
249 To compile this driver as a module, choose M here: the module will
250 be called sch_mqprio.
254 config NET_SCH_SKBPRIO
255 tristate "SKB priority queue scheduler (SKBPRIO)"
257 Say Y here if you want to use the SKB priority queue
258 scheduler. This schedules packets according to skb->priority,
259 which is useful for request packets in DoS mitigation systems such
262 To compile this driver as a module, choose M here: the module will
263 be called sch_skbprio.
268 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
270 Say Y here if you want to use the CHOKe packet scheduler (CHOose
271 and Keep for responsive flows, CHOose and Kill for unresponsive
272 flows). This is a variation of RED which trys to penalize flows
273 that monopolize the queue.
275 To compile this code as a module, choose M here: the
276 module will be called sch_choke.
279 tristate "Quick Fair Queueing scheduler (QFQ)"
281 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
282 packet scheduling algorithm.
284 To compile this driver as a module, choose M here: the module
285 will be called sch_qfq.
290 tristate "Controlled Delay AQM (CODEL)"
292 Say Y here if you want to use the Controlled Delay (CODEL)
293 packet scheduling algorithm.
295 To compile this driver as a module, choose M here: the module
296 will be called sch_codel.
300 config NET_SCH_FQ_CODEL
301 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
303 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
304 packet scheduling algorithm.
306 To compile this driver as a module, choose M here: the module
307 will be called sch_fq_codel.
312 tristate "Common Applications Kept Enhanced (CAKE)"
314 Say Y here if you want to use the Common Applications Kept Enhanced
315 (CAKE) queue management algorithm.
317 To compile this driver as a module, choose M here: the module
318 will be called sch_cake.
323 tristate "Fair Queue"
325 Say Y here if you want to use the FQ packet scheduling algorithm.
327 FQ does flow separation, and is able to respect pacing requirements
328 set by TCP stack into sk->sk_pacing_rate (for localy generated
331 To compile this driver as a module, choose M here: the module
332 will be called sch_fq.
337 tristate "Heavy-Hitter Filter (HHF)"
339 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
340 packet scheduling algorithm.
342 To compile this driver as a module, choose M here: the module
343 will be called sch_hhf.
346 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
348 Say Y here if you want to use the Proportional Integral controller
349 Enhanced scheduler packet scheduling algorithm.
350 For more information, please see
351 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
353 To compile this driver as a module, choose M here: the module
354 will be called sch_pie.
358 config NET_SCH_INGRESS
359 tristate "Ingress/classifier-action Qdisc"
360 depends on NET_CLS_ACT
364 Say Y here if you want to use classifiers for incoming and/or outgoing
365 packets. This qdisc doesn't do anything else besides running classifiers,
366 which can also have actions attached to them. In case of outgoing packets,
367 classifiers that this qdisc holds are executed in the transmit path
368 before real enqueuing to an egress qdisc happens.
372 To compile this code as a module, choose M here: the module will be
373 called sch_ingress with alias of sch_clsact.
376 tristate "Plug network traffic until release (PLUG)"
379 This queuing discipline allows userspace to plug/unplug a network
380 output queue, using the netlink interface. When it receives an
381 enqueue command it inserts a plug into the outbound queue that
382 causes following packets to enqueue until a dequeue command arrives
383 over netlink, causing the plug to be removed and resuming the normal
386 This module also provides a generic "network output buffering"
387 functionality (aka output commit), wherein upon arrival of a dequeue
388 command, only packets up to the first plug are released for delivery.
389 The Remus HA project uses this module to enable speculative execution
390 of virtual machines by allowing the generated network output to be rolled
393 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
395 Say Y here if you are using this kernel for Xen dom0 and
396 want to protect Xen guests with Remus.
398 To compile this code as a module, choose M here: the
399 module will be called sch_plug.
401 menuconfig NET_SCH_DEFAULT
402 bool "Allow override default queue discipline"
404 Support for selection of default queuing discipline.
406 Nearly all users can safely say no here, and the default
407 of pfifo_fast will be used. Many distributions already set
408 the default value via /proc/sys/net/core/default_qdisc.
415 prompt "Default queuing discipline"
416 default DEFAULT_PFIFO_FAST
418 Select the queueing discipline that will be used by default
419 for all network devices.
422 bool "Fair Queue" if NET_SCH_FQ
425 bool "Controlled Delay" if NET_SCH_CODEL
427 config DEFAULT_FQ_CODEL
428 bool "Fair Queue Controlled Delay" if NET_SCH_FQ_CODEL
431 bool "Stochastic Fair Queue" if NET_SCH_SFQ
433 config DEFAULT_PFIFO_FAST
434 bool "Priority FIFO Fast"
437 config DEFAULT_NET_SCH
439 default "pfifo_fast" if DEFAULT_PFIFO_FAST
440 default "fq" if DEFAULT_FQ
441 default "fq_codel" if DEFAULT_FQ_CODEL
442 default "sfq" if DEFAULT_SFQ
446 comment "Classification"
452 tristate "Elementary classification (BASIC)"
455 Say Y here if you want to be able to classify packets using
456 only extended matches and actions.
458 To compile this code as a module, choose M here: the
459 module will be called cls_basic.
461 config NET_CLS_TCINDEX
462 tristate "Traffic-Control Index (TCINDEX)"
465 Say Y here if you want to be able to classify packets based on
466 traffic control indices. You will want this feature if you want
467 to implement Differentiated Services together with DSMARK.
469 To compile this code as a module, choose M here: the
470 module will be called cls_tcindex.
472 config NET_CLS_ROUTE4
473 tristate "Routing decision (ROUTE)"
475 select IP_ROUTE_CLASSID
478 If you say Y here, you will be able to classify packets
479 according to the route table entry they matched.
481 To compile this code as a module, choose M here: the
482 module will be called cls_route.
485 tristate "Netfilter mark (FW)"
488 If you say Y here, you will be able to classify packets
489 according to netfilter/firewall marks.
491 To compile this code as a module, choose M here: the
492 module will be called cls_fw.
495 tristate "Universal 32bit comparisons w/ hashing (U32)"
498 Say Y here to be able to classify packets using a universal
499 32bit pieces based comparison scheme.
501 To compile this code as a module, choose M here: the
502 module will be called cls_u32.
505 bool "Performance counters support"
506 depends on NET_CLS_U32
508 Say Y here to make u32 gather additional statistics useful for
509 fine tuning u32 classifiers.
512 bool "Netfilter marks support"
513 depends on NET_CLS_U32
515 Say Y here to be able to use netfilter marks as u32 key.
518 tristate "IPv4 Resource Reservation Protocol (RSVP)"
521 The Resource Reservation Protocol (RSVP) permits end systems to
522 request a minimum and maximum data flow rate for a connection; this
523 is important for real time data such as streaming sound or video.
525 Say Y here if you want to be able to classify outgoing packets based
526 on their RSVP requests.
528 To compile this code as a module, choose M here: the
529 module will be called cls_rsvp.
532 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
535 The Resource Reservation Protocol (RSVP) permits end systems to
536 request a minimum and maximum data flow rate for a connection; this
537 is important for real time data such as streaming sound or video.
539 Say Y here if you want to be able to classify outgoing packets based
540 on their RSVP requests and you are using the IPv6 protocol.
542 To compile this code as a module, choose M here: the
543 module will be called cls_rsvp6.
546 tristate "Flow classifier"
549 If you say Y here, you will be able to classify packets based on
550 a configurable combination of packet keys. This is mostly useful
551 in combination with SFQ.
553 To compile this code as a module, choose M here: the
554 module will be called cls_flow.
556 config NET_CLS_CGROUP
557 tristate "Control Group Classifier"
559 select CGROUP_NET_CLASSID
562 Say Y here if you want to classify packets based on the control
563 cgroup of their process.
565 To compile this code as a module, choose M here: the
566 module will be called cls_cgroup.
569 tristate "BPF-based classifier"
572 If you say Y here, you will be able to classify packets based on
573 programmable BPF (JIT'ed) filters as an alternative to ematches.
575 To compile this code as a module, choose M here: the module will
578 config NET_CLS_FLOWER
579 tristate "Flower classifier"
582 If you say Y here, you will be able to classify packets based on
583 a configurable combination of packet keys and masks.
585 To compile this code as a module, choose M here: the module will
586 be called cls_flower.
588 config NET_CLS_MATCHALL
589 tristate "Match-all classifier"
592 If you say Y here, you will be able to classify packets based on
593 nothing. Every packet will match.
595 To compile this code as a module, choose M here: the module will
596 be called cls_matchall.
599 bool "Extended Matches"
602 Say Y here if you want to use extended matches on top of classifiers
603 and select the extended matches below.
605 Extended matches are small classification helpers not worth writing
606 a separate classifier for.
608 A recent version of the iproute2 package is required to use
611 config NET_EMATCH_STACK
613 depends on NET_EMATCH
616 Size of the local stack variable used while evaluating the tree of
617 ematches. Limits the depth of the tree, i.e. the number of
618 encapsulated precedences. Every level requires 4 bytes of additional
621 config NET_EMATCH_CMP
622 tristate "Simple packet data comparison"
623 depends on NET_EMATCH
625 Say Y here if you want to be able to classify packets based on
626 simple packet data comparisons for 8, 16, and 32bit values.
628 To compile this code as a module, choose M here: the
629 module will be called em_cmp.
631 config NET_EMATCH_NBYTE
632 tristate "Multi byte comparison"
633 depends on NET_EMATCH
635 Say Y here if you want to be able to classify packets based on
636 multiple byte comparisons mainly useful for IPv6 address comparisons.
638 To compile this code as a module, choose M here: the
639 module will be called em_nbyte.
641 config NET_EMATCH_U32
643 depends on NET_EMATCH
645 Say Y here if you want to be able to classify packets using
646 the famous u32 key in combination with logic relations.
648 To compile this code as a module, choose M here: the
649 module will be called em_u32.
651 config NET_EMATCH_META
653 depends on NET_EMATCH
655 Say Y here if you want to be able to classify packets based on
656 metadata such as load average, netfilter attributes, socket
657 attributes and routing decisions.
659 To compile this code as a module, choose M here: the
660 module will be called em_meta.
662 config NET_EMATCH_TEXT
663 tristate "Textsearch"
664 depends on NET_EMATCH
666 select TEXTSEARCH_KMP
668 select TEXTSEARCH_FSM
670 Say Y here if you want to be able to classify packets based on
671 textsearch comparisons.
673 To compile this code as a module, choose M here: the
674 module will be called em_text.
676 config NET_EMATCH_CANID
677 tristate "CAN Identifier"
678 depends on NET_EMATCH && (CAN=y || CAN=m)
680 Say Y here if you want to be able to classify CAN frames based
683 To compile this code as a module, choose M here: the
684 module will be called em_canid.
686 config NET_EMATCH_IPSET
688 depends on NET_EMATCH && IP_SET
690 Say Y here if you want to be able to classify packets based on
693 To compile this code as a module, choose M here: the
694 module will be called em_ipset.
696 config NET_EMATCH_IPT
697 tristate "IPtables Matches"
698 depends on NET_EMATCH && NETFILTER && NETFILTER_XTABLES
700 Say Y here to be able to classify packets based on iptables
702 Current supported match is "policy" which allows packet classification
703 based on IPsec policy that was used during decapsulation
705 To compile this code as a module, choose M here: the
706 module will be called em_ipt.
712 Say Y here if you want to use traffic control actions. Actions
713 get attached to classifiers and are invoked after a successful
714 classification. They are used to overwrite the classification
715 result, instantly drop or redirect packets, etc.
717 A recent version of the iproute2 package is required to use
720 config NET_ACT_POLICE
721 tristate "Traffic Policing"
722 depends on NET_CLS_ACT
724 Say Y here if you want to do traffic policing, i.e. strict
725 bandwidth limiting. This action replaces the existing policing
728 To compile this code as a module, choose M here: the
729 module will be called act_police.
732 tristate "Generic actions"
733 depends on NET_CLS_ACT
735 Say Y here to take generic actions such as dropping and
738 To compile this code as a module, choose M here: the
739 module will be called act_gact.
742 bool "Probability support"
743 depends on NET_ACT_GACT
745 Say Y here to use the generic action randomly or deterministically.
747 config NET_ACT_MIRRED
748 tristate "Redirecting and Mirroring"
749 depends on NET_CLS_ACT
751 Say Y here to allow packets to be mirrored or redirected to
754 To compile this code as a module, choose M here: the
755 module will be called act_mirred.
757 config NET_ACT_SAMPLE
758 tristate "Traffic Sampling"
759 depends on NET_CLS_ACT
762 Say Y here to allow packet sampling tc action. The packet sample
763 action consists of statistically choosing packets and sampling
764 them using the psample module.
766 To compile this code as a module, choose M here: the
767 module will be called act_sample.
770 tristate "IPtables targets"
771 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
773 Say Y here to be able to invoke iptables targets after successful
776 To compile this code as a module, choose M here: the
777 module will be called act_ipt.
780 tristate "Stateless NAT"
781 depends on NET_CLS_ACT
783 Say Y here to do stateless NAT on IPv4 packets. You should use
784 netfilter for NAT unless you know what you are doing.
786 To compile this code as a module, choose M here: the
787 module will be called act_nat.
790 tristate "Packet Editing"
791 depends on NET_CLS_ACT
793 Say Y here if you want to mangle the content of packets.
795 To compile this code as a module, choose M here: the
796 module will be called act_pedit.
799 tristate "Simple Example (Debug)"
800 depends on NET_CLS_ACT
802 Say Y here to add a simple action for demonstration purposes.
803 It is meant as an example and for debugging purposes. It will
804 print a configured policy string followed by the packet count
805 to the console for every packet that passes by.
809 To compile this code as a module, choose M here: the
810 module will be called act_simple.
812 config NET_ACT_SKBEDIT
813 tristate "SKB Editing"
814 depends on NET_CLS_ACT
816 Say Y here to change skb priority or queue_mapping settings.
820 To compile this code as a module, choose M here: the
821 module will be called act_skbedit.
824 tristate "Checksum Updating"
825 depends on NET_CLS_ACT && INET
828 Say Y here to update some common checksum after some direct
831 To compile this code as a module, choose M here: the
832 module will be called act_csum.
835 tristate "Vlan manipulation"
836 depends on NET_CLS_ACT
838 Say Y here to push or pop vlan headers.
842 To compile this code as a module, choose M here: the
843 module will be called act_vlan.
846 tristate "BPF based action"
847 depends on NET_CLS_ACT
849 Say Y here to execute BPF code on packets. The BPF code will decide
850 if the packet should be dropped or not.
854 To compile this code as a module, choose M here: the
855 module will be called act_bpf.
857 config NET_ACT_CONNMARK
858 tristate "Netfilter Connection Mark Retriever"
859 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
860 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
862 Say Y here to allow retrieving of conn mark
866 To compile this code as a module, choose M here: the
867 module will be called act_connmark.
869 config NET_ACT_SKBMOD
870 tristate "skb data modification action"
871 depends on NET_CLS_ACT
873 Say Y here to allow modification of skb data
877 To compile this code as a module, choose M here: the
878 module will be called act_skbmod.
881 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
882 depends on NET_CLS_ACT
885 Say Y here to allow for sourcing and terminating metadata
886 For details refer to netdev01 paper:
887 "Distributing Linux Traffic Control Classifier-Action Subsystem"
888 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
890 To compile this code as a module, choose M here: the
891 module will be called act_ife.
893 config NET_ACT_TUNNEL_KEY
894 tristate "IP tunnel metadata manipulation"
895 depends on NET_CLS_ACT
897 Say Y here to set/release ip tunnel metadata.
901 To compile this code as a module, choose M here: the
902 module will be called act_tunnel_key.
904 config NET_IFE_SKBMARK
905 tristate "Support to encoding decoding skb mark on IFE action"
906 depends on NET_ACT_IFE
908 config NET_IFE_SKBPRIO
909 tristate "Support to encoding decoding skb prio on IFE action"
910 depends on NET_ACT_IFE
912 config NET_IFE_SKBTCINDEX
913 tristate "Support to encoding decoding skb tcindex on IFE action"
914 depends on NET_ACT_IFE
917 bool "Incoming device classification"
918 depends on NET_CLS_U32 || NET_CLS_FW
920 Say Y here to extend the u32 and fw classifier to support
921 classification based on the incoming device. This option is
922 likely to disappear in favour of the metadata ematch.