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 <ftp://ftp.tux.org/pub/net/ip-routing/>.
26 That package also contains some documentation; for more, check out
27 <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
29 This Quality of Service (QoS) support will enable you to use
30 Differentiated Services (diffserv) and Resource Reservation Protocol
31 (RSVP) on your Linux router if you also say Y to the corresponding
32 classifiers below. Documentation and software is at
33 <http://diffserv.sourceforge.net/>.
35 If you say Y here and to "/proc file system" below, you will be able
36 to read status information about packet schedulers from the file
39 The available schedulers are listed in the following questions; you
40 can say Y to as many as you like. If unsure, say N now.
44 comment "Queueing/Scheduling"
47 tristate "Class Based Queueing (CBQ)"
49 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
50 scheduling algorithm. This algorithm classifies the waiting packets
51 into a tree-like hierarchy of classes; the leaves of this tree are
52 in turn scheduled by separate algorithms.
54 See the top of <file:net/sched/sch_cbq.c> for more details.
56 CBQ is a commonly used scheduler, so if you're unsure, you should
57 say Y here. Then say Y to all the queueing algorithms below that you
58 want to use as leaf disciplines.
60 To compile this code as a module, choose M here: the
61 module will be called sch_cbq.
64 tristate "Hierarchical Token Bucket (HTB)"
66 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
67 packet scheduling algorithm. See
68 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
71 HTB is very similar to CBQ regarding its goals however is has
72 different properties and different algorithm.
74 To compile this code as a module, choose M here: the
75 module will be called sch_htb.
78 tristate "Hierarchical Fair Service Curve (HFSC)"
80 Say Y here if you want to use the Hierarchical Fair Service Curve
81 (HFSC) packet scheduling algorithm.
83 To compile this code as a module, choose M here: the
84 module will be called sch_hfsc.
87 tristate "ATM Virtual Circuits (ATM)"
90 Say Y here if you want to use the ATM pseudo-scheduler. This
91 provides a framework for invoking classifiers, which in turn
92 select classes of this queuing discipline. Each class maps
93 the flow(s) it is handling to a given virtual circuit.
95 See the top of <file:net/sched/sch_atm.c> for more details.
97 To compile this code as a module, choose M here: the
98 module will be called sch_atm.
101 tristate "Multi Band Priority Queueing (PRIO)"
103 Say Y here if you want to use an n-band priority queue packet
106 To compile this code as a module, choose M here: the
107 module will be called sch_prio.
109 config NET_SCH_MULTIQ
110 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
112 Say Y here if you want to use an n-band queue packet scheduler
113 to support devices that have multiple hardware transmit queues.
115 To compile this code as a module, choose M here: the
116 module will be called sch_multiq.
119 tristate "Random Early Detection (RED)"
121 Say Y here if you want to use the Random Early Detection (RED)
122 packet scheduling algorithm.
124 See the top of <file:net/sched/sch_red.c> for more details.
126 To compile this code as a module, choose M here: the
127 module will be called sch_red.
130 tristate "Stochastic Fair Blue (SFB)"
132 Say Y here if you want to use the Stochastic Fair Blue (SFB)
133 packet scheduling algorithm.
135 See the top of <file:net/sched/sch_sfb.c> for more details.
137 To compile this code as a module, choose M here: the
138 module will be called sch_sfb.
141 tristate "Stochastic Fairness Queueing (SFQ)"
143 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
144 packet scheduling algorithm.
146 See the top of <file:net/sched/sch_sfq.c> for more details.
148 To compile this code as a module, choose M here: the
149 module will be called sch_sfq.
152 tristate "True Link Equalizer (TEQL)"
154 Say Y here if you want to use the True Link Equalizer (TLE) packet
155 scheduling algorithm. This queueing discipline allows the combination
156 of several physical devices into one virtual device.
158 See the top of <file:net/sched/sch_teql.c> for more details.
160 To compile this code as a module, choose M here: the
161 module will be called sch_teql.
164 tristate "Token Bucket Filter (TBF)"
166 Say Y here if you want to use the Token Bucket Filter (TBF) packet
167 scheduling algorithm.
169 See the top of <file:net/sched/sch_tbf.c> for more details.
171 To compile this code as a module, choose M here: the
172 module will be called sch_tbf.
175 tristate "Generic Random Early Detection (GRED)"
177 Say Y here if you want to use the Generic Random Early Detection
178 (GRED) packet scheduling algorithm for some of your network devices
179 (see the top of <file:net/sched/sch_red.c> for details and
180 references about the algorithm).
182 To compile this code as a module, choose M here: the
183 module will be called sch_gred.
185 config NET_SCH_DSMARK
186 tristate "Differentiated Services marker (DSMARK)"
188 Say Y if you want to schedule packets according to the
189 Differentiated Services architecture proposed in RFC 2475.
190 Technical information on this method, with pointers to associated
191 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
193 To compile this code as a module, choose M here: the
194 module will be called sch_dsmark.
197 tristate "Network emulator (NETEM)"
199 Say Y if you want to emulate network delay, loss, and packet
200 re-ordering. This is often useful to simulate networks when
201 testing applications or protocols.
203 To compile this driver as a module, choose M here: the module
204 will be called sch_netem.
209 tristate "Deficit Round Robin scheduler (DRR)"
211 Say Y here if you want to use the Deficit Round Robin (DRR) packet
212 scheduling algorithm.
214 To compile this driver as a module, choose M here: the module
215 will be called sch_drr.
219 config NET_SCH_MQPRIO
220 tristate "Multi-queue priority scheduler (MQPRIO)"
222 Say Y here if you want to use the Multi-queue Priority scheduler.
223 This scheduler allows QOS to be offloaded on NICs that have support
224 for offloading QOS schedulers.
226 To compile this driver as a module, choose M here: the module will
227 be called sch_mqprio.
232 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
234 Say Y here if you want to use the CHOKe packet scheduler (CHOose
235 and Keep for responsive flows, CHOose and Kill for unresponsive
236 flows). This is a variation of RED which trys to penalize flows
237 that monopolize the queue.
239 To compile this code as a module, choose M here: the
240 module will be called sch_choke.
243 tristate "Quick Fair Queueing scheduler (QFQ)"
245 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
246 packet scheduling algorithm.
248 To compile this driver as a module, choose M here: the module
249 will be called sch_qfq.
254 tristate "Controlled Delay AQM (CODEL)"
256 Say Y here if you want to use the Controlled Delay (CODEL)
257 packet scheduling algorithm.
259 To compile this driver as a module, choose M here: the module
260 will be called sch_codel.
264 config NET_SCH_FQ_CODEL
265 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
267 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
268 packet scheduling algorithm.
270 To compile this driver as a module, choose M here: the module
271 will be called sch_fq_codel.
276 tristate "Fair Queue"
278 Say Y here if you want to use the FQ packet scheduling algorithm.
280 FQ does flow separation, and is able to respect pacing requirements
281 set by TCP stack into sk->sk_pacing_rate (for localy generated
284 To compile this driver as a module, choose M here: the module
285 will be called sch_fq.
290 tristate "Heavy-Hitter Filter (HHF)"
292 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
293 packet scheduling algorithm.
295 To compile this driver as a module, choose M here: the module
296 will be called sch_hhf.
299 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
301 Say Y here if you want to use the Proportional Integral controller
302 Enhanced scheduler packet scheduling algorithm.
303 For more information, please see
304 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
306 To compile this driver as a module, choose M here: the module
307 will be called sch_pie.
311 config NET_SCH_INGRESS
312 tristate "Ingress Qdisc"
313 depends on NET_CLS_ACT
315 Say Y here if you want to use classifiers for incoming packets.
318 To compile this code as a module, choose M here: the
319 module will be called sch_ingress.
322 tristate "Plug network traffic until release (PLUG)"
325 This queuing discipline allows userspace to plug/unplug a network
326 output queue, using the netlink interface. When it receives an
327 enqueue command it inserts a plug into the outbound queue that
328 causes following packets to enqueue until a dequeue command arrives
329 over netlink, causing the plug to be removed and resuming the normal
332 This module also provides a generic "network output buffering"
333 functionality (aka output commit), wherein upon arrival of a dequeue
334 command, only packets up to the first plug are released for delivery.
335 The Remus HA project uses this module to enable speculative execution
336 of virtual machines by allowing the generated network output to be rolled
339 For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
341 Say Y here if you are using this kernel for Xen dom0 and
342 want to protect Xen guests with Remus.
344 To compile this code as a module, choose M here: the
345 module will be called sch_plug.
347 comment "Classification"
353 tristate "Elementary classification (BASIC)"
356 Say Y here if you want to be able to classify packets using
357 only extended matches and actions.
359 To compile this code as a module, choose M here: the
360 module will be called cls_basic.
362 config NET_CLS_TCINDEX
363 tristate "Traffic-Control Index (TCINDEX)"
366 Say Y here if you want to be able to classify packets based on
367 traffic control indices. You will want this feature if you want
368 to implement Differentiated Services together with DSMARK.
370 To compile this code as a module, choose M here: the
371 module will be called cls_tcindex.
373 config NET_CLS_ROUTE4
374 tristate "Routing decision (ROUTE)"
376 select IP_ROUTE_CLASSID
379 If you say Y here, you will be able to classify packets
380 according to the route table entry they matched.
382 To compile this code as a module, choose M here: the
383 module will be called cls_route.
386 tristate "Netfilter mark (FW)"
389 If you say Y here, you will be able to classify packets
390 according to netfilter/firewall marks.
392 To compile this code as a module, choose M here: the
393 module will be called cls_fw.
396 tristate "Universal 32bit comparisons w/ hashing (U32)"
399 Say Y here to be able to classify packets using a universal
400 32bit pieces based comparison scheme.
402 To compile this code as a module, choose M here: the
403 module will be called cls_u32.
406 bool "Performance counters support"
407 depends on NET_CLS_U32
409 Say Y here to make u32 gather additional statistics useful for
410 fine tuning u32 classifiers.
413 bool "Netfilter marks support"
414 depends on NET_CLS_U32
416 Say Y here to be able to use netfilter marks as u32 key.
419 tristate "IPv4 Resource Reservation Protocol (RSVP)"
422 The Resource Reservation Protocol (RSVP) permits end systems to
423 request a minimum and maximum data flow rate for a connection; this
424 is important for real time data such as streaming sound or video.
426 Say Y here if you want to be able to classify outgoing packets based
427 on their RSVP requests.
429 To compile this code as a module, choose M here: the
430 module will be called cls_rsvp.
433 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
436 The Resource Reservation Protocol (RSVP) permits end systems to
437 request a minimum and maximum data flow rate for a connection; this
438 is important for real time data such as streaming sound or video.
440 Say Y here if you want to be able to classify outgoing packets based
441 on their RSVP requests and you are using the IPv6 protocol.
443 To compile this code as a module, choose M here: the
444 module will be called cls_rsvp6.
447 tristate "Flow classifier"
450 If you say Y here, you will be able to classify packets based on
451 a configurable combination of packet keys. This is mostly useful
452 in combination with SFQ.
454 To compile this code as a module, choose M here: the
455 module will be called cls_flow.
457 config NET_CLS_CGROUP
458 tristate "Control Group Classifier"
460 select CGROUP_NET_CLASSID
463 Say Y here if you want to classify packets based on the control
464 cgroup of their process.
466 To compile this code as a module, choose M here: the
467 module will be called cls_cgroup.
470 tristate "BPF-based classifier"
473 If you say Y here, you will be able to classify packets based on
474 programmable BPF (JIT'ed) filters as an alternative to ematches.
476 To compile this code as a module, choose M here: the module will
480 bool "Extended Matches"
483 Say Y here if you want to use extended matches on top of classifiers
484 and select the extended matches below.
486 Extended matches are small classification helpers not worth writing
487 a separate classifier for.
489 A recent version of the iproute2 package is required to use
492 config NET_EMATCH_STACK
494 depends on NET_EMATCH
497 Size of the local stack variable used while evaluating the tree of
498 ematches. Limits the depth of the tree, i.e. the number of
499 encapsulated precedences. Every level requires 4 bytes of additional
502 config NET_EMATCH_CMP
503 tristate "Simple packet data comparison"
504 depends on NET_EMATCH
506 Say Y here if you want to be able to classify packets based on
507 simple packet data comparisons for 8, 16, and 32bit values.
509 To compile this code as a module, choose M here: the
510 module will be called em_cmp.
512 config NET_EMATCH_NBYTE
513 tristate "Multi byte comparison"
514 depends on NET_EMATCH
516 Say Y here if you want to be able to classify packets based on
517 multiple byte comparisons mainly useful for IPv6 address comparisons.
519 To compile this code as a module, choose M here: the
520 module will be called em_nbyte.
522 config NET_EMATCH_U32
524 depends on NET_EMATCH
526 Say Y here if you want to be able to classify packets using
527 the famous u32 key in combination with logic relations.
529 To compile this code as a module, choose M here: the
530 module will be called em_u32.
532 config NET_EMATCH_META
534 depends on NET_EMATCH
536 Say Y here if you want to be able to classify packets based on
537 metadata such as load average, netfilter attributes, socket
538 attributes and routing decisions.
540 To compile this code as a module, choose M here: the
541 module will be called em_meta.
543 config NET_EMATCH_TEXT
544 tristate "Textsearch"
545 depends on NET_EMATCH
547 select TEXTSEARCH_KMP
549 select TEXTSEARCH_FSM
551 Say Y here if you want to be able to classify packets based on
552 textsearch comparisons.
554 To compile this code as a module, choose M here: the
555 module will be called em_text.
557 config NET_EMATCH_CANID
558 tristate "CAN Identifier"
559 depends on NET_EMATCH && (CAN=y || CAN=m)
561 Say Y here if you want to be able to classify CAN frames based
564 To compile this code as a module, choose M here: the
565 module will be called em_canid.
567 config NET_EMATCH_IPSET
569 depends on NET_EMATCH && IP_SET
571 Say Y here if you want to be able to classify packets based on
574 To compile this code as a module, choose M here: the
575 module will be called em_ipset.
580 Say Y here if you want to use traffic control actions. Actions
581 get attached to classifiers and are invoked after a successful
582 classification. They are used to overwrite the classification
583 result, instantly drop or redirect packets, etc.
585 A recent version of the iproute2 package is required to use
588 config NET_ACT_POLICE
589 tristate "Traffic Policing"
590 depends on NET_CLS_ACT
592 Say Y here if you want to do traffic policing, i.e. strict
593 bandwidth limiting. This action replaces the existing policing
596 To compile this code as a module, choose M here: the
597 module will be called act_police.
600 tristate "Generic actions"
601 depends on NET_CLS_ACT
603 Say Y here to take generic actions such as dropping and
606 To compile this code as a module, choose M here: the
607 module will be called act_gact.
610 bool "Probability support"
611 depends on NET_ACT_GACT
613 Say Y here to use the generic action randomly or deterministically.
615 config NET_ACT_MIRRED
616 tristate "Redirecting and Mirroring"
617 depends on NET_CLS_ACT
619 Say Y here to allow packets to be mirrored or redirected to
622 To compile this code as a module, choose M here: the
623 module will be called act_mirred.
626 tristate "IPtables targets"
627 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
629 Say Y here to be able to invoke iptables targets after successful
632 To compile this code as a module, choose M here: the
633 module will be called act_ipt.
636 tristate "Stateless NAT"
637 depends on NET_CLS_ACT
639 Say Y here to do stateless NAT on IPv4 packets. You should use
640 netfilter for NAT unless you know what you are doing.
642 To compile this code as a module, choose M here: the
643 module will be called act_nat.
646 tristate "Packet Editing"
647 depends on NET_CLS_ACT
649 Say Y here if you want to mangle the content of packets.
651 To compile this code as a module, choose M here: the
652 module will be called act_pedit.
655 tristate "Simple Example (Debug)"
656 depends on NET_CLS_ACT
658 Say Y here to add a simple action for demonstration purposes.
659 It is meant as an example and for debugging purposes. It will
660 print a configured policy string followed by the packet count
661 to the console for every packet that passes by.
665 To compile this code as a module, choose M here: the
666 module will be called act_simple.
668 config NET_ACT_SKBEDIT
669 tristate "SKB Editing"
670 depends on NET_CLS_ACT
672 Say Y here to change skb priority or queue_mapping settings.
676 To compile this code as a module, choose M here: the
677 module will be called act_skbedit.
680 tristate "Checksum Updating"
681 depends on NET_CLS_ACT && INET
683 Say Y here to update some common checksum after some direct
686 To compile this code as a module, choose M here: the
687 module will be called act_csum.
690 bool "Incoming device classification"
691 depends on NET_CLS_U32 || NET_CLS_FW
693 Say Y here to extend the u32 and fw classifier to support
694 classification based on the incoming device. This option is
695 likely to disappear in favour of the metadata ematch.