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://linux-net.osdl.org/index.php/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 Fairness Queueing (SFQ)"
132 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
133 packet scheduling algorithm.
135 See the top of <file:net/sched/sch_sfq.c> for more details.
137 To compile this code as a module, choose M here: the
138 module will be called sch_sfq.
141 tristate "True Link Equalizer (TEQL)"
143 Say Y here if you want to use the True Link Equalizer (TLE) packet
144 scheduling algorithm. This queueing discipline allows the combination
145 of several physical devices into one virtual device.
147 See the top of <file:net/sched/sch_teql.c> for more details.
149 To compile this code as a module, choose M here: the
150 module will be called sch_teql.
153 tristate "Token Bucket Filter (TBF)"
155 Say Y here if you want to use the Token Bucket Filter (TBF) packet
156 scheduling algorithm.
158 See the top of <file:net/sched/sch_tbf.c> for more details.
160 To compile this code as a module, choose M here: the
161 module will be called sch_tbf.
164 tristate "Generic Random Early Detection (GRED)"
166 Say Y here if you want to use the Generic Random Early Detection
167 (GRED) packet scheduling algorithm for some of your network devices
168 (see the top of <file:net/sched/sch_red.c> for details and
169 references about the algorithm).
171 To compile this code as a module, choose M here: the
172 module will be called sch_gred.
174 config NET_SCH_DSMARK
175 tristate "Differentiated Services marker (DSMARK)"
177 Say Y if you want to schedule packets according to the
178 Differentiated Services architecture proposed in RFC 2475.
179 Technical information on this method, with pointers to associated
180 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
182 To compile this code as a module, choose M here: the
183 module will be called sch_dsmark.
186 tristate "Network emulator (NETEM)"
188 Say Y if you want to emulate network delay, loss, and packet
189 re-ordering. This is often useful to simulate networks when
190 testing applications or protocols.
192 To compile this driver as a module, choose M here: the module
193 will be called sch_netem.
198 tristate "Deficit Round Robin scheduler (DRR)"
200 Say Y here if you want to use the Deficit Round Robin (DRR) packet
201 scheduling algorithm.
203 To compile this driver as a module, choose M here: the module
204 will be called sch_drr.
208 config NET_SCH_INGRESS
209 tristate "Ingress Qdisc"
210 depends on NET_CLS_ACT
212 Say Y here if you want to use classifiers for incoming packets.
215 To compile this code as a module, choose M here: the
216 module will be called sch_ingress.
218 comment "Classification"
224 tristate "Elementary classification (BASIC)"
227 Say Y here if you want to be able to classify packets using
228 only extended matches and actions.
230 To compile this code as a module, choose M here: the
231 module will be called cls_basic.
233 config NET_CLS_TCINDEX
234 tristate "Traffic-Control Index (TCINDEX)"
237 Say Y here if you want to be able to classify packets based on
238 traffic control indices. You will want this feature if you want
239 to implement Differentiated Services together with DSMARK.
241 To compile this code as a module, choose M here: the
242 module will be called cls_tcindex.
244 config NET_CLS_ROUTE4
245 tristate "Routing decision (ROUTE)"
249 If you say Y here, you will be able to classify packets
250 according to the route table entry they matched.
252 To compile this code as a module, choose M here: the
253 module will be called cls_route.
259 tristate "Netfilter mark (FW)"
262 If you say Y here, you will be able to classify packets
263 according to netfilter/firewall marks.
265 To compile this code as a module, choose M here: the
266 module will be called cls_fw.
269 tristate "Universal 32bit comparisons w/ hashing (U32)"
272 Say Y here to be able to classify packets using a universal
273 32bit pieces based comparison scheme.
275 To compile this code as a module, choose M here: the
276 module will be called cls_u32.
279 bool "Performance counters support"
280 depends on NET_CLS_U32
282 Say Y here to make u32 gather additional statistics useful for
283 fine tuning u32 classifiers.
286 bool "Netfilter marks support"
287 depends on NET_CLS_U32
289 Say Y here to be able to use netfilter marks as u32 key.
292 tristate "IPv4 Resource Reservation Protocol (RSVP)"
295 The Resource Reservation Protocol (RSVP) permits end systems to
296 request a minimum and maximum data flow rate for a connection; this
297 is important for real time data such as streaming sound or video.
299 Say Y here if you want to be able to classify outgoing packets based
300 on their RSVP requests.
302 To compile this code as a module, choose M here: the
303 module will be called cls_rsvp.
306 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
309 The Resource Reservation Protocol (RSVP) permits end systems to
310 request a minimum and maximum data flow rate for a connection; this
311 is important for real time data such as streaming sound or video.
313 Say Y here if you want to be able to classify outgoing packets based
314 on their RSVP requests and you are using the IPv6 protocol.
316 To compile this code as a module, choose M here: the
317 module will be called cls_rsvp6.
320 tristate "Flow classifier"
323 If you say Y here, you will be able to classify packets based on
324 a configurable combination of packet keys. This is mostly useful
325 in combination with SFQ.
327 To compile this code as a module, choose M here: the
328 module will be called cls_flow.
330 config NET_CLS_CGROUP
331 bool "Control Group Classifier"
335 Say Y here if you want to classify packets based on the control
336 cgroup of their process.
339 bool "Extended Matches"
342 Say Y here if you want to use extended matches on top of classifiers
343 and select the extended matches below.
345 Extended matches are small classification helpers not worth writing
346 a separate classifier for.
348 A recent version of the iproute2 package is required to use
351 config NET_EMATCH_STACK
353 depends on NET_EMATCH
356 Size of the local stack variable used while evaluating the tree of
357 ematches. Limits the depth of the tree, i.e. the number of
358 encapsulated precedences. Every level requires 4 bytes of additional
361 config NET_EMATCH_CMP
362 tristate "Simple packet data comparison"
363 depends on NET_EMATCH
365 Say Y here if you want to be able to classify packets based on
366 simple packet data comparisons for 8, 16, and 32bit values.
368 To compile this code as a module, choose M here: the
369 module will be called em_cmp.
371 config NET_EMATCH_NBYTE
372 tristate "Multi byte comparison"
373 depends on NET_EMATCH
375 Say Y here if you want to be able to classify packets based on
376 multiple byte comparisons mainly useful for IPv6 address comparisons.
378 To compile this code as a module, choose M here: the
379 module will be called em_nbyte.
381 config NET_EMATCH_U32
383 depends on NET_EMATCH
385 Say Y here if you want to be able to classify packets using
386 the famous u32 key in combination with logic relations.
388 To compile this code as a module, choose M here: the
389 module will be called em_u32.
391 config NET_EMATCH_META
393 depends on NET_EMATCH
395 Say Y here if you want to be able to classify packets based on
396 metadata such as load average, netfilter attributes, socket
397 attributes and routing decisions.
399 To compile this code as a module, choose M here: the
400 module will be called em_meta.
402 config NET_EMATCH_TEXT
403 tristate "Textsearch"
404 depends on NET_EMATCH
406 select TEXTSEARCH_KMP
408 select TEXTSEARCH_FSM
410 Say Y here if you want to be able to classify packets based on
411 textsearch comparisons.
413 To compile this code as a module, choose M here: the
414 module will be called em_text.
419 Say Y here if you want to use traffic control actions. Actions
420 get attached to classifiers and are invoked after a successful
421 classification. They are used to overwrite the classification
422 result, instantly drop or redirect packets, etc.
424 A recent version of the iproute2 package is required to use
427 config NET_ACT_POLICE
428 tristate "Traffic Policing"
429 depends on NET_CLS_ACT
431 Say Y here if you want to do traffic policing, i.e. strict
432 bandwidth limiting. This action replaces the existing policing
435 To compile this code as a module, choose M here: the
436 module will be called police.
439 tristate "Generic actions"
440 depends on NET_CLS_ACT
442 Say Y here to take generic actions such as dropping and
445 To compile this code as a module, choose M here: the
446 module will be called gact.
449 bool "Probability support"
450 depends on NET_ACT_GACT
452 Say Y here to use the generic action randomly or deterministically.
454 config NET_ACT_MIRRED
455 tristate "Redirecting and Mirroring"
456 depends on NET_CLS_ACT
458 Say Y here to allow packets to be mirrored or redirected to
461 To compile this code as a module, choose M here: the
462 module will be called mirred.
465 tristate "IPtables targets"
466 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
468 Say Y here to be able to invoke iptables targets after successful
471 To compile this code as a module, choose M here: the
472 module will be called ipt.
475 tristate "Stateless NAT"
476 depends on NET_CLS_ACT
478 Say Y here to do stateless NAT on IPv4 packets. You should use
479 netfilter for NAT unless you know what you are doing.
481 To compile this code as a module, choose M here: the
482 module will be called nat.
485 tristate "Packet Editing"
486 depends on NET_CLS_ACT
488 Say Y here if you want to mangle the content of packets.
490 To compile this code as a module, choose M here: the
491 module will be called pedit.
494 tristate "Simple Example (Debug)"
495 depends on NET_CLS_ACT
497 Say Y here to add a simple action for demonstration purposes.
498 It is meant as an example and for debugging purposes. It will
499 print a configured policy string followed by the packet count
500 to the console for every packet that passes by.
504 To compile this code as a module, choose M here: the
505 module will be called simple.
507 config NET_ACT_SKBEDIT
508 tristate "SKB Editing"
509 depends on NET_CLS_ACT
511 Say Y here to change skb priority or queue_mapping settings.
515 To compile this code as a module, choose M here: the
516 module will be called skbedit.
519 bool "Incoming device classification"
520 depends on NET_CLS_U32 || NET_CLS_FW
522 Say Y here to extend the u32 and fw classifier to support
523 classification based on the incoming device. This option is
524 likely to disappear in favour of the metadata ematch.