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.
253 config NET_SCH_INGRESS
254 tristate "Ingress Qdisc"
255 depends on NET_CLS_ACT
257 Say Y here if you want to use classifiers for incoming packets.
260 To compile this code as a module, choose M here: the
261 module will be called sch_ingress.
264 tristate "Plug network traffic until release (PLUG)"
267 This queuing discipline allows userspace to plug/unplug a network
268 output queue, using the netlink interface. When it receives an
269 enqueue command it inserts a plug into the outbound queue that
270 causes following packets to enqueue until a dequeue command arrives
271 over netlink, causing the plug to be removed and resuming the normal
274 This module also provides a generic "network output buffering"
275 functionality (aka output commit), wherein upon arrival of a dequeue
276 command, only packets up to the first plug are released for delivery.
277 The Remus HA project uses this module to enable speculative execution
278 of virtual machines by allowing the generated network output to be rolled
281 For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
283 Say Y here if you are using this kernel for Xen dom0 and
284 want to protect Xen guests with Remus.
286 To compile this code as a module, choose M here: the
287 module will be called sch_plug.
289 comment "Classification"
295 tristate "Elementary classification (BASIC)"
298 Say Y here if you want to be able to classify packets using
299 only extended matches and actions.
301 To compile this code as a module, choose M here: the
302 module will be called cls_basic.
304 config NET_CLS_TCINDEX
305 tristate "Traffic-Control Index (TCINDEX)"
308 Say Y here if you want to be able to classify packets based on
309 traffic control indices. You will want this feature if you want
310 to implement Differentiated Services together with DSMARK.
312 To compile this code as a module, choose M here: the
313 module will be called cls_tcindex.
315 config NET_CLS_ROUTE4
316 tristate "Routing decision (ROUTE)"
318 select IP_ROUTE_CLASSID
321 If you say Y here, you will be able to classify packets
322 according to the route table entry they matched.
324 To compile this code as a module, choose M here: the
325 module will be called cls_route.
328 tristate "Netfilter mark (FW)"
331 If you say Y here, you will be able to classify packets
332 according to netfilter/firewall marks.
334 To compile this code as a module, choose M here: the
335 module will be called cls_fw.
338 tristate "Universal 32bit comparisons w/ hashing (U32)"
341 Say Y here to be able to classify packets using a universal
342 32bit pieces based comparison scheme.
344 To compile this code as a module, choose M here: the
345 module will be called cls_u32.
348 bool "Performance counters support"
349 depends on NET_CLS_U32
351 Say Y here to make u32 gather additional statistics useful for
352 fine tuning u32 classifiers.
355 bool "Netfilter marks support"
356 depends on NET_CLS_U32
358 Say Y here to be able to use netfilter marks as u32 key.
361 tristate "IPv4 Resource Reservation Protocol (RSVP)"
364 The Resource Reservation Protocol (RSVP) permits end systems to
365 request a minimum and maximum data flow rate for a connection; this
366 is important for real time data such as streaming sound or video.
368 Say Y here if you want to be able to classify outgoing packets based
369 on their RSVP requests.
371 To compile this code as a module, choose M here: the
372 module will be called cls_rsvp.
375 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
378 The Resource Reservation Protocol (RSVP) permits end systems to
379 request a minimum and maximum data flow rate for a connection; this
380 is important for real time data such as streaming sound or video.
382 Say Y here if you want to be able to classify outgoing packets based
383 on their RSVP requests and you are using the IPv6 protocol.
385 To compile this code as a module, choose M here: the
386 module will be called cls_rsvp6.
389 tristate "Flow classifier"
392 If you say Y here, you will be able to classify packets based on
393 a configurable combination of packet keys. This is mostly useful
394 in combination with SFQ.
396 To compile this code as a module, choose M here: the
397 module will be called cls_flow.
399 config NET_CLS_CGROUP
400 tristate "Control Group Classifier"
404 Say Y here if you want to classify packets based on the control
405 cgroup of their process.
407 To compile this code as a module, choose M here: the
408 module will be called cls_cgroup.
411 bool "Extended Matches"
414 Say Y here if you want to use extended matches on top of classifiers
415 and select the extended matches below.
417 Extended matches are small classification helpers not worth writing
418 a separate classifier for.
420 A recent version of the iproute2 package is required to use
423 config NET_EMATCH_STACK
425 depends on NET_EMATCH
428 Size of the local stack variable used while evaluating the tree of
429 ematches. Limits the depth of the tree, i.e. the number of
430 encapsulated precedences. Every level requires 4 bytes of additional
433 config NET_EMATCH_CMP
434 tristate "Simple packet data comparison"
435 depends on NET_EMATCH
437 Say Y here if you want to be able to classify packets based on
438 simple packet data comparisons for 8, 16, and 32bit values.
440 To compile this code as a module, choose M here: the
441 module will be called em_cmp.
443 config NET_EMATCH_NBYTE
444 tristate "Multi byte comparison"
445 depends on NET_EMATCH
447 Say Y here if you want to be able to classify packets based on
448 multiple byte comparisons mainly useful for IPv6 address comparisons.
450 To compile this code as a module, choose M here: the
451 module will be called em_nbyte.
453 config NET_EMATCH_U32
455 depends on NET_EMATCH
457 Say Y here if you want to be able to classify packets using
458 the famous u32 key in combination with logic relations.
460 To compile this code as a module, choose M here: the
461 module will be called em_u32.
463 config NET_EMATCH_META
465 depends on NET_EMATCH
467 Say Y here if you want to be able to classify packets based on
468 metadata such as load average, netfilter attributes, socket
469 attributes and routing decisions.
471 To compile this code as a module, choose M here: the
472 module will be called em_meta.
474 config NET_EMATCH_TEXT
475 tristate "Textsearch"
476 depends on NET_EMATCH
478 select TEXTSEARCH_KMP
480 select TEXTSEARCH_FSM
482 Say Y here if you want to be able to classify packets based on
483 textsearch comparisons.
485 To compile this code as a module, choose M here: the
486 module will be called em_text.
491 Say Y here if you want to use traffic control actions. Actions
492 get attached to classifiers and are invoked after a successful
493 classification. They are used to overwrite the classification
494 result, instantly drop or redirect packets, etc.
496 A recent version of the iproute2 package is required to use
499 config NET_ACT_POLICE
500 tristate "Traffic Policing"
501 depends on NET_CLS_ACT
503 Say Y here if you want to do traffic policing, i.e. strict
504 bandwidth limiting. This action replaces the existing policing
507 To compile this code as a module, choose M here: the
508 module will be called act_police.
511 tristate "Generic actions"
512 depends on NET_CLS_ACT
514 Say Y here to take generic actions such as dropping and
517 To compile this code as a module, choose M here: the
518 module will be called act_gact.
521 bool "Probability support"
522 depends on NET_ACT_GACT
524 Say Y here to use the generic action randomly or deterministically.
526 config NET_ACT_MIRRED
527 tristate "Redirecting and Mirroring"
528 depends on NET_CLS_ACT
530 Say Y here to allow packets to be mirrored or redirected to
533 To compile this code as a module, choose M here: the
534 module will be called act_mirred.
537 tristate "IPtables targets"
538 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
540 Say Y here to be able to invoke iptables targets after successful
543 To compile this code as a module, choose M here: the
544 module will be called act_ipt.
547 tristate "Stateless NAT"
548 depends on NET_CLS_ACT
550 Say Y here to do stateless NAT on IPv4 packets. You should use
551 netfilter for NAT unless you know what you are doing.
553 To compile this code as a module, choose M here: the
554 module will be called act_nat.
557 tristate "Packet Editing"
558 depends on NET_CLS_ACT
560 Say Y here if you want to mangle the content of packets.
562 To compile this code as a module, choose M here: the
563 module will be called act_pedit.
566 tristate "Simple Example (Debug)"
567 depends on NET_CLS_ACT
569 Say Y here to add a simple action for demonstration purposes.
570 It is meant as an example and for debugging purposes. It will
571 print a configured policy string followed by the packet count
572 to the console for every packet that passes by.
576 To compile this code as a module, choose M here: the
577 module will be called act_simple.
579 config NET_ACT_SKBEDIT
580 tristate "SKB Editing"
581 depends on NET_CLS_ACT
583 Say Y here to change skb priority or queue_mapping settings.
587 To compile this code as a module, choose M here: the
588 module will be called act_skbedit.
591 tristate "Checksum Updating"
592 depends on NET_CLS_ACT && INET
594 Say Y here to update some common checksum after some direct
597 To compile this code as a module, choose M here: the
598 module will be called act_csum.
601 bool "Incoming device classification"
602 depends on NET_CLS_U32 || NET_CLS_FW
604 Say Y here to extend the u32 and fw classifier to support
605 classification based on the incoming device. This option is
606 likely to disappear in favour of the metadata ematch.