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.
242 config NET_SCH_INGRESS
243 tristate "Ingress Qdisc"
244 depends on NET_CLS_ACT
246 Say Y here if you want to use classifiers for incoming packets.
249 To compile this code as a module, choose M here: the
250 module will be called sch_ingress.
252 comment "Classification"
258 tristate "Elementary classification (BASIC)"
261 Say Y here if you want to be able to classify packets using
262 only extended matches and actions.
264 To compile this code as a module, choose M here: the
265 module will be called cls_basic.
267 config NET_CLS_TCINDEX
268 tristate "Traffic-Control Index (TCINDEX)"
271 Say Y here if you want to be able to classify packets based on
272 traffic control indices. You will want this feature if you want
273 to implement Differentiated Services together with DSMARK.
275 To compile this code as a module, choose M here: the
276 module will be called cls_tcindex.
278 config NET_CLS_ROUTE4
279 tristate "Routing decision (ROUTE)"
280 select IP_ROUTE_CLASSID
283 If you say Y here, you will be able to classify packets
284 according to the route table entry they matched.
286 To compile this code as a module, choose M here: the
287 module will be called cls_route.
290 tristate "Netfilter mark (FW)"
293 If you say Y here, you will be able to classify packets
294 according to netfilter/firewall marks.
296 To compile this code as a module, choose M here: the
297 module will be called cls_fw.
300 tristate "Universal 32bit comparisons w/ hashing (U32)"
303 Say Y here to be able to classify packets using a universal
304 32bit pieces based comparison scheme.
306 To compile this code as a module, choose M here: the
307 module will be called cls_u32.
310 bool "Performance counters support"
311 depends on NET_CLS_U32
313 Say Y here to make u32 gather additional statistics useful for
314 fine tuning u32 classifiers.
317 bool "Netfilter marks support"
318 depends on NET_CLS_U32
320 Say Y here to be able to use netfilter marks as u32 key.
323 tristate "IPv4 Resource Reservation Protocol (RSVP)"
326 The Resource Reservation Protocol (RSVP) permits end systems to
327 request a minimum and maximum data flow rate for a connection; this
328 is important for real time data such as streaming sound or video.
330 Say Y here if you want to be able to classify outgoing packets based
331 on their RSVP requests.
333 To compile this code as a module, choose M here: the
334 module will be called cls_rsvp.
337 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
340 The Resource Reservation Protocol (RSVP) permits end systems to
341 request a minimum and maximum data flow rate for a connection; this
342 is important for real time data such as streaming sound or video.
344 Say Y here if you want to be able to classify outgoing packets based
345 on their RSVP requests and you are using the IPv6 protocol.
347 To compile this code as a module, choose M here: the
348 module will be called cls_rsvp6.
351 tristate "Flow classifier"
354 If you say Y here, you will be able to classify packets based on
355 a configurable combination of packet keys. This is mostly useful
356 in combination with SFQ.
358 To compile this code as a module, choose M here: the
359 module will be called cls_flow.
361 config NET_CLS_CGROUP
362 tristate "Control Group Classifier"
366 Say Y here if you want to classify packets based on the control
367 cgroup of their process.
369 To compile this code as a module, choose M here: the
370 module will be called cls_cgroup.
373 bool "Extended Matches"
376 Say Y here if you want to use extended matches on top of classifiers
377 and select the extended matches below.
379 Extended matches are small classification helpers not worth writing
380 a separate classifier for.
382 A recent version of the iproute2 package is required to use
385 config NET_EMATCH_STACK
387 depends on NET_EMATCH
390 Size of the local stack variable used while evaluating the tree of
391 ematches. Limits the depth of the tree, i.e. the number of
392 encapsulated precedences. Every level requires 4 bytes of additional
395 config NET_EMATCH_CMP
396 tristate "Simple packet data comparison"
397 depends on NET_EMATCH
399 Say Y here if you want to be able to classify packets based on
400 simple packet data comparisons for 8, 16, and 32bit values.
402 To compile this code as a module, choose M here: the
403 module will be called em_cmp.
405 config NET_EMATCH_NBYTE
406 tristate "Multi byte comparison"
407 depends on NET_EMATCH
409 Say Y here if you want to be able to classify packets based on
410 multiple byte comparisons mainly useful for IPv6 address comparisons.
412 To compile this code as a module, choose M here: the
413 module will be called em_nbyte.
415 config NET_EMATCH_U32
417 depends on NET_EMATCH
419 Say Y here if you want to be able to classify packets using
420 the famous u32 key in combination with logic relations.
422 To compile this code as a module, choose M here: the
423 module will be called em_u32.
425 config NET_EMATCH_META
427 depends on NET_EMATCH
429 Say Y here if you want to be able to classify packets based on
430 metadata such as load average, netfilter attributes, socket
431 attributes and routing decisions.
433 To compile this code as a module, choose M here: the
434 module will be called em_meta.
436 config NET_EMATCH_TEXT
437 tristate "Textsearch"
438 depends on NET_EMATCH
440 select TEXTSEARCH_KMP
442 select TEXTSEARCH_FSM
444 Say Y here if you want to be able to classify packets based on
445 textsearch comparisons.
447 To compile this code as a module, choose M here: the
448 module will be called em_text.
453 Say Y here if you want to use traffic control actions. Actions
454 get attached to classifiers and are invoked after a successful
455 classification. They are used to overwrite the classification
456 result, instantly drop or redirect packets, etc.
458 A recent version of the iproute2 package is required to use
461 config NET_ACT_POLICE
462 tristate "Traffic Policing"
463 depends on NET_CLS_ACT
465 Say Y here if you want to do traffic policing, i.e. strict
466 bandwidth limiting. This action replaces the existing policing
469 To compile this code as a module, choose M here: the
470 module will be called act_police.
473 tristate "Generic actions"
474 depends on NET_CLS_ACT
476 Say Y here to take generic actions such as dropping and
479 To compile this code as a module, choose M here: the
480 module will be called act_gact.
483 bool "Probability support"
484 depends on NET_ACT_GACT
486 Say Y here to use the generic action randomly or deterministically.
488 config NET_ACT_MIRRED
489 tristate "Redirecting and Mirroring"
490 depends on NET_CLS_ACT
492 Say Y here to allow packets to be mirrored or redirected to
495 To compile this code as a module, choose M here: the
496 module will be called act_mirred.
499 tristate "IPtables targets"
500 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
502 Say Y here to be able to invoke iptables targets after successful
505 To compile this code as a module, choose M here: the
506 module will be called act_ipt.
509 tristate "Stateless NAT"
510 depends on NET_CLS_ACT
512 Say Y here to do stateless NAT on IPv4 packets. You should use
513 netfilter for NAT unless you know what you are doing.
515 To compile this code as a module, choose M here: the
516 module will be called act_nat.
519 tristate "Packet Editing"
520 depends on NET_CLS_ACT
522 Say Y here if you want to mangle the content of packets.
524 To compile this code as a module, choose M here: the
525 module will be called act_pedit.
528 tristate "Simple Example (Debug)"
529 depends on NET_CLS_ACT
531 Say Y here to add a simple action for demonstration purposes.
532 It is meant as an example and for debugging purposes. It will
533 print a configured policy string followed by the packet count
534 to the console for every packet that passes by.
538 To compile this code as a module, choose M here: the
539 module will be called act_simple.
541 config NET_ACT_SKBEDIT
542 tristate "SKB Editing"
543 depends on NET_CLS_ACT
545 Say Y here to change skb priority or queue_mapping settings.
549 To compile this code as a module, choose M here: the
550 module will be called act_skbedit.
553 tristate "Checksum Updating"
554 depends on NET_CLS_ACT && INET
556 Say Y here to update some common checksum after some direct
559 To compile this code as a module, choose M here: the
560 module will be called act_csum.
563 bool "Incoming device classification"
564 depends on NET_CLS_U32 || NET_CLS_FW
566 Say Y here to extend the u32 and fw classifier to support
567 classification based on the incoming device. This option is
568 likely to disappear in favour of the metadata ematch.