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 "Generic Random Early Detection (GRED)"
178 Say Y here if you want to use the Generic Random Early Detection
179 (GRED) packet scheduling algorithm for some of your network devices
180 (see the top of <file:net/sched/sch_red.c> for details and
181 references about the algorithm).
183 To compile this code as a module, choose M here: the
184 module will be called sch_gred.
186 config NET_SCH_DSMARK
187 tristate "Differentiated Services marker (DSMARK)"
189 Say Y if you want to schedule packets according to the
190 Differentiated Services architecture proposed in RFC 2475.
191 Technical information on this method, with pointers to associated
192 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
194 To compile this code as a module, choose M here: the
195 module will be called sch_dsmark.
198 tristate "Network emulator (NETEM)"
200 Say Y if you want to emulate network delay, loss, and packet
201 re-ordering. This is often useful to simulate networks when
202 testing applications or protocols.
204 To compile this driver as a module, choose M here: the module
205 will be called sch_netem.
210 tristate "Deficit Round Robin scheduler (DRR)"
212 Say Y here if you want to use the Deficit Round Robin (DRR) packet
213 scheduling algorithm.
215 To compile this driver as a module, choose M here: the module
216 will be called sch_drr.
220 config NET_SCH_MQPRIO
221 tristate "Multi-queue priority scheduler (MQPRIO)"
223 Say Y here if you want to use the Multi-queue Priority scheduler.
224 This scheduler allows QOS to be offloaded on NICs that have support
225 for offloading QOS schedulers.
227 To compile this driver as a module, choose M here: the module will
228 be called sch_mqprio.
233 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
235 Say Y here if you want to use the CHOKe packet scheduler (CHOose
236 and Keep for responsive flows, CHOose and Kill for unresponsive
237 flows). This is a variation of RED which trys to penalize flows
238 that monopolize the queue.
240 To compile this code as a module, choose M here: the
241 module will be called sch_choke.
244 tristate "Quick Fair Queueing scheduler (QFQ)"
246 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
247 packet scheduling algorithm.
249 To compile this driver as a module, choose M here: the module
250 will be called sch_qfq.
255 tristate "Controlled Delay AQM (CODEL)"
257 Say Y here if you want to use the Controlled Delay (CODEL)
258 packet scheduling algorithm.
260 To compile this driver as a module, choose M here: the module
261 will be called sch_codel.
265 config NET_SCH_FQ_CODEL
266 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
268 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
269 packet scheduling algorithm.
271 To compile this driver as a module, choose M here: the module
272 will be called sch_fq_codel.
277 tristate "Fair Queue"
279 Say Y here if you want to use the FQ packet scheduling algorithm.
281 FQ does flow separation, and is able to respect pacing requirements
282 set by TCP stack into sk->sk_pacing_rate (for localy generated
285 To compile this driver as a module, choose M here: the module
286 will be called sch_fq.
291 tristate "Heavy-Hitter Filter (HHF)"
293 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
294 packet scheduling algorithm.
296 To compile this driver as a module, choose M here: the module
297 will be called sch_hhf.
300 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
302 Say Y here if you want to use the Proportional Integral controller
303 Enhanced scheduler packet scheduling algorithm.
304 For more information, please see
305 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
307 To compile this driver as a module, choose M here: the module
308 will be called sch_pie.
312 config NET_SCH_INGRESS
313 tristate "Ingress/classifier-action Qdisc"
314 depends on NET_CLS_ACT
318 Say Y here if you want to use classifiers for incoming and/or outgoing
319 packets. This qdisc doesn't do anything else besides running classifiers,
320 which can also have actions attached to them. In case of outgoing packets,
321 classifiers that this qdisc holds are executed in the transmit path
322 before real enqueuing to an egress qdisc happens.
326 To compile this code as a module, choose M here: the module will be
327 called sch_ingress with alias of sch_clsact.
330 tristate "Plug network traffic until release (PLUG)"
333 This queuing discipline allows userspace to plug/unplug a network
334 output queue, using the netlink interface. When it receives an
335 enqueue command it inserts a plug into the outbound queue that
336 causes following packets to enqueue until a dequeue command arrives
337 over netlink, causing the plug to be removed and resuming the normal
340 This module also provides a generic "network output buffering"
341 functionality (aka output commit), wherein upon arrival of a dequeue
342 command, only packets up to the first plug are released for delivery.
343 The Remus HA project uses this module to enable speculative execution
344 of virtual machines by allowing the generated network output to be rolled
347 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
349 Say Y here if you are using this kernel for Xen dom0 and
350 want to protect Xen guests with Remus.
352 To compile this code as a module, choose M here: the
353 module will be called sch_plug.
355 menuconfig NET_SCH_DEFAULT
356 bool "Allow override default queue discipline"
358 Support for selection of default queuing discipline.
360 Nearly all users can safely say no here, and the default
361 of pfifo_fast will be used. Many distributions already set
362 the default value via /proc/sys/net/core/default_qdisc.
369 prompt "Default queuing discipline"
370 default DEFAULT_PFIFO_FAST
372 Select the queueing discipline that will be used by default
373 for all network devices.
376 bool "Fair Queue" if NET_SCH_FQ
379 bool "Controlled Delay" if NET_SCH_CODEL
381 config DEFAULT_FQ_CODEL
382 bool "Fair Queue Controlled Delay" if NET_SCH_FQ_CODEL
385 bool "Stochastic Fair Queue" if NET_SCH_SFQ
387 config DEFAULT_PFIFO_FAST
388 bool "Priority FIFO Fast"
391 config DEFAULT_NET_SCH
393 default "pfifo_fast" if DEFAULT_PFIFO_FAST
394 default "fq" if DEFAULT_FQ
395 default "fq_codel" if DEFAULT_FQ_CODEL
396 default "sfq" if DEFAULT_SFQ
400 comment "Classification"
406 tristate "Elementary classification (BASIC)"
409 Say Y here if you want to be able to classify packets using
410 only extended matches and actions.
412 To compile this code as a module, choose M here: the
413 module will be called cls_basic.
415 config NET_CLS_ROUTE4
416 tristate "Routing decision (ROUTE)"
418 select IP_ROUTE_CLASSID
421 If you say Y here, you will be able to classify packets
422 according to the route table entry they matched.
424 To compile this code as a module, choose M here: the
425 module will be called cls_route.
428 tristate "Netfilter mark (FW)"
431 If you say Y here, you will be able to classify packets
432 according to netfilter/firewall marks.
434 To compile this code as a module, choose M here: the
435 module will be called cls_fw.
438 tristate "Universal 32bit comparisons w/ hashing (U32)"
441 Say Y here to be able to classify packets using a universal
442 32bit pieces based comparison scheme.
444 To compile this code as a module, choose M here: the
445 module will be called cls_u32.
448 bool "Performance counters support"
449 depends on NET_CLS_U32
451 Say Y here to make u32 gather additional statistics useful for
452 fine tuning u32 classifiers.
455 bool "Netfilter marks support"
456 depends on NET_CLS_U32
458 Say Y here to be able to use netfilter marks as u32 key.
461 tristate "IPv4 Resource Reservation Protocol (RSVP)"
464 The Resource Reservation Protocol (RSVP) permits end systems to
465 request a minimum and maximum data flow rate for a connection; this
466 is important for real time data such as streaming sound or video.
468 Say Y here if you want to be able to classify outgoing packets based
469 on their RSVP requests.
471 To compile this code as a module, choose M here: the
472 module will be called cls_rsvp.
475 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
478 The Resource Reservation Protocol (RSVP) permits end systems to
479 request a minimum and maximum data flow rate for a connection; this
480 is important for real time data such as streaming sound or video.
482 Say Y here if you want to be able to classify outgoing packets based
483 on their RSVP requests and you are using the IPv6 protocol.
485 To compile this code as a module, choose M here: the
486 module will be called cls_rsvp6.
489 tristate "Flow classifier"
492 If you say Y here, you will be able to classify packets based on
493 a configurable combination of packet keys. This is mostly useful
494 in combination with SFQ.
496 To compile this code as a module, choose M here: the
497 module will be called cls_flow.
499 config NET_CLS_CGROUP
500 tristate "Control Group Classifier"
502 select CGROUP_NET_CLASSID
505 Say Y here if you want to classify packets based on the control
506 cgroup of their process.
508 To compile this code as a module, choose M here: the
509 module will be called cls_cgroup.
512 tristate "BPF-based classifier"
515 If you say Y here, you will be able to classify packets based on
516 programmable BPF (JIT'ed) filters as an alternative to ematches.
518 To compile this code as a module, choose M here: the module will
521 config NET_CLS_FLOWER
522 tristate "Flower classifier"
525 If you say Y here, you will be able to classify packets based on
526 a configurable combination of packet keys and masks.
528 To compile this code as a module, choose M here: the module will
529 be called cls_flower.
531 config NET_CLS_MATCHALL
532 tristate "Match-all classifier"
535 If you say Y here, you will be able to classify packets based on
536 nothing. Every packet will match.
538 To compile this code as a module, choose M here: the module will
539 be called cls_matchall.
542 bool "Extended Matches"
545 Say Y here if you want to use extended matches on top of classifiers
546 and select the extended matches below.
548 Extended matches are small classification helpers not worth writing
549 a separate classifier for.
551 A recent version of the iproute2 package is required to use
554 config NET_EMATCH_STACK
556 depends on NET_EMATCH
559 Size of the local stack variable used while evaluating the tree of
560 ematches. Limits the depth of the tree, i.e. the number of
561 encapsulated precedences. Every level requires 4 bytes of additional
564 config NET_EMATCH_CMP
565 tristate "Simple packet data comparison"
566 depends on NET_EMATCH
568 Say Y here if you want to be able to classify packets based on
569 simple packet data comparisons for 8, 16, and 32bit values.
571 To compile this code as a module, choose M here: the
572 module will be called em_cmp.
574 config NET_EMATCH_NBYTE
575 tristate "Multi byte comparison"
576 depends on NET_EMATCH
578 Say Y here if you want to be able to classify packets based on
579 multiple byte comparisons mainly useful for IPv6 address comparisons.
581 To compile this code as a module, choose M here: the
582 module will be called em_nbyte.
584 config NET_EMATCH_U32
586 depends on NET_EMATCH
588 Say Y here if you want to be able to classify packets using
589 the famous u32 key in combination with logic relations.
591 To compile this code as a module, choose M here: the
592 module will be called em_u32.
594 config NET_EMATCH_META
596 depends on NET_EMATCH
598 Say Y here if you want to be able to classify packets based on
599 metadata such as load average, netfilter attributes, socket
600 attributes and routing decisions.
602 To compile this code as a module, choose M here: the
603 module will be called em_meta.
605 config NET_EMATCH_TEXT
606 tristate "Textsearch"
607 depends on NET_EMATCH
609 select TEXTSEARCH_KMP
611 select TEXTSEARCH_FSM
613 Say Y here if you want to be able to classify packets based on
614 textsearch comparisons.
616 To compile this code as a module, choose M here: the
617 module will be called em_text.
619 config NET_EMATCH_CANID
620 tristate "CAN Identifier"
621 depends on NET_EMATCH && (CAN=y || CAN=m)
623 Say Y here if you want to be able to classify CAN frames based
626 To compile this code as a module, choose M here: the
627 module will be called em_canid.
629 config NET_EMATCH_IPSET
631 depends on NET_EMATCH && IP_SET
633 Say Y here if you want to be able to classify packets based on
636 To compile this code as a module, choose M here: the
637 module will be called em_ipset.
643 Say Y here if you want to use traffic control actions. Actions
644 get attached to classifiers and are invoked after a successful
645 classification. They are used to overwrite the classification
646 result, instantly drop or redirect packets, etc.
648 A recent version of the iproute2 package is required to use
651 config NET_ACT_POLICE
652 tristate "Traffic Policing"
653 depends on NET_CLS_ACT
655 Say Y here if you want to do traffic policing, i.e. strict
656 bandwidth limiting. This action replaces the existing policing
659 To compile this code as a module, choose M here: the
660 module will be called act_police.
663 tristate "Generic actions"
664 depends on NET_CLS_ACT
666 Say Y here to take generic actions such as dropping and
669 To compile this code as a module, choose M here: the
670 module will be called act_gact.
673 bool "Probability support"
674 depends on NET_ACT_GACT
676 Say Y here to use the generic action randomly or deterministically.
678 config NET_ACT_MIRRED
679 tristate "Redirecting and Mirroring"
680 depends on NET_CLS_ACT
682 Say Y here to allow packets to be mirrored or redirected to
685 To compile this code as a module, choose M here: the
686 module will be called act_mirred.
688 config NET_ACT_SAMPLE
689 tristate "Traffic Sampling"
690 depends on NET_CLS_ACT
693 Say Y here to allow packet sampling tc action. The packet sample
694 action consists of statistically choosing packets and sampling
695 them using the psample module.
697 To compile this code as a module, choose M here: the
698 module will be called act_sample.
701 tristate "IPtables targets"
702 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
704 Say Y here to be able to invoke iptables targets after successful
707 To compile this code as a module, choose M here: the
708 module will be called act_ipt.
711 tristate "Stateless NAT"
712 depends on NET_CLS_ACT
714 Say Y here to do stateless NAT on IPv4 packets. You should use
715 netfilter for NAT unless you know what you are doing.
717 To compile this code as a module, choose M here: the
718 module will be called act_nat.
721 tristate "Packet Editing"
722 depends on NET_CLS_ACT
724 Say Y here if you want to mangle the content of packets.
726 To compile this code as a module, choose M here: the
727 module will be called act_pedit.
730 tristate "Simple Example (Debug)"
731 depends on NET_CLS_ACT
733 Say Y here to add a simple action for demonstration purposes.
734 It is meant as an example and for debugging purposes. It will
735 print a configured policy string followed by the packet count
736 to the console for every packet that passes by.
740 To compile this code as a module, choose M here: the
741 module will be called act_simple.
743 config NET_ACT_SKBEDIT
744 tristate "SKB Editing"
745 depends on NET_CLS_ACT
747 Say Y here to change skb priority or queue_mapping settings.
751 To compile this code as a module, choose M here: the
752 module will be called act_skbedit.
755 tristate "Checksum Updating"
756 depends on NET_CLS_ACT && INET
759 Say Y here to update some common checksum after some direct
762 To compile this code as a module, choose M here: the
763 module will be called act_csum.
766 tristate "Vlan manipulation"
767 depends on NET_CLS_ACT
769 Say Y here to push or pop vlan headers.
773 To compile this code as a module, choose M here: the
774 module will be called act_vlan.
777 tristate "BPF based action"
778 depends on NET_CLS_ACT
780 Say Y here to execute BPF code on packets. The BPF code will decide
781 if the packet should be dropped or not.
785 To compile this code as a module, choose M here: the
786 module will be called act_bpf.
788 config NET_ACT_CONNMARK
789 tristate "Netfilter Connection Mark Retriever"
790 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
791 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
793 Say Y here to allow retrieving of conn mark
797 To compile this code as a module, choose M here: the
798 module will be called act_connmark.
800 config NET_ACT_SKBMOD
801 tristate "skb data modification action"
802 depends on NET_CLS_ACT
804 Say Y here to allow modification of skb data
808 To compile this code as a module, choose M here: the
809 module will be called act_skbmod.
812 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
813 depends on NET_CLS_ACT
816 Say Y here to allow for sourcing and terminating metadata
817 For details refer to netdev01 paper:
818 "Distributing Linux Traffic Control Classifier-Action Subsystem"
819 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
821 To compile this code as a module, choose M here: the
822 module will be called act_ife.
824 config NET_ACT_TUNNEL_KEY
825 tristate "IP tunnel metadata manipulation"
826 depends on NET_CLS_ACT
828 Say Y here to set/release ip tunnel metadata.
832 To compile this code as a module, choose M here: the
833 module will be called act_tunnel_key.
835 config NET_IFE_SKBMARK
836 tristate "Support to encoding decoding skb mark on IFE action"
837 depends on NET_ACT_IFE
840 config NET_IFE_SKBPRIO
841 tristate "Support to encoding decoding skb prio on IFE action"
842 depends on NET_ACT_IFE
845 config NET_IFE_SKBTCINDEX
846 tristate "Support to encoding decoding skb tcindex on IFE action"
847 depends on NET_ACT_IFE
851 bool "Incoming device classification"
852 depends on NET_CLS_U32 || NET_CLS_FW
854 Say Y here to extend the u32 and fw classifier to support
855 classification based on the incoming device. This option is
856 likely to disappear in favour of the metadata ematch.