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.
110 tristate "Random Early Detection (RED)"
112 Say Y here if you want to use the Random Early Detection (RED)
113 packet scheduling algorithm.
115 See the top of <file:net/sched/sch_red.c> for more details.
117 To compile this code as a module, choose M here: the
118 module will be called sch_red.
121 tristate "Stochastic Fairness Queueing (SFQ)"
123 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
124 packet scheduling algorithm.
126 See the top of <file:net/sched/sch_sfq.c> for more details.
128 To compile this code as a module, choose M here: the
129 module will be called sch_sfq.
132 tristate "True Link Equalizer (TEQL)"
134 Say Y here if you want to use the True Link Equalizer (TLE) packet
135 scheduling algorithm. This queueing discipline allows the combination
136 of several physical devices into one virtual device.
138 See the top of <file:net/sched/sch_teql.c> for more details.
140 To compile this code as a module, choose M here: the
141 module will be called sch_teql.
144 tristate "Token Bucket Filter (TBF)"
146 Say Y here if you want to use the Token Bucket Filter (TBF) packet
147 scheduling algorithm.
149 See the top of <file:net/sched/sch_tbf.c> for more details.
151 To compile this code as a module, choose M here: the
152 module will be called sch_tbf.
155 tristate "Generic Random Early Detection (GRED)"
157 Say Y here if you want to use the Generic Random Early Detection
158 (GRED) packet scheduling algorithm for some of your network devices
159 (see the top of <file:net/sched/sch_red.c> for details and
160 references about the algorithm).
162 To compile this code as a module, choose M here: the
163 module will be called sch_gred.
165 config NET_SCH_DSMARK
166 tristate "Differentiated Services marker (DSMARK)"
168 Say Y if you want to schedule packets according to the
169 Differentiated Services architecture proposed in RFC 2475.
170 Technical information on this method, with pointers to associated
171 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
173 To compile this code as a module, choose M here: the
174 module will be called sch_dsmark.
177 tristate "Network emulator (NETEM)"
179 Say Y if you want to emulate network delay, loss, and packet
180 re-ordering. This is often useful to simulate networks when
181 testing applications or protocols.
183 To compile this driver as a module, choose M here: the module
184 will be called sch_netem.
188 config NET_SCH_INGRESS
189 tristate "Ingress Qdisc"
190 depends on NET_CLS_ACT
192 Say Y here if you want to use classifiers for incoming packets.
195 To compile this code as a module, choose M here: the
196 module will be called sch_ingress.
198 comment "Classification"
204 tristate "Elementary classification (BASIC)"
207 Say Y here if you want to be able to classify packets using
208 only extended matches and actions.
210 To compile this code as a module, choose M here: the
211 module will be called cls_basic.
213 config NET_CLS_TCINDEX
214 tristate "Traffic-Control Index (TCINDEX)"
217 Say Y here if you want to be able to classify packets based on
218 traffic control indices. You will want this feature if you want
219 to implement Differentiated Services together with DSMARK.
221 To compile this code as a module, choose M here: the
222 module will be called cls_tcindex.
224 config NET_CLS_ROUTE4
225 tristate "Routing decision (ROUTE)"
229 If you say Y here, you will be able to classify packets
230 according to the route table entry they matched.
232 To compile this code as a module, choose M here: the
233 module will be called cls_route.
239 tristate "Netfilter mark (FW)"
242 If you say Y here, you will be able to classify packets
243 according to netfilter/firewall marks.
245 To compile this code as a module, choose M here: the
246 module will be called cls_fw.
249 tristate "Universal 32bit comparisons w/ hashing (U32)"
252 Say Y here to be able to classify packets using a universal
253 32bit pieces based comparison scheme.
255 To compile this code as a module, choose M here: the
256 module will be called cls_u32.
259 bool "Performance counters support"
260 depends on NET_CLS_U32
262 Say Y here to make u32 gather additional statistics useful for
263 fine tuning u32 classifiers.
266 bool "Netfilter marks support"
267 depends on NET_CLS_U32
269 Say Y here to be able to use netfilter marks as u32 key.
272 tristate "IPv4 Resource Reservation Protocol (RSVP)"
275 The Resource Reservation Protocol (RSVP) permits end systems to
276 request a minimum and maximum data flow rate for a connection; this
277 is important for real time data such as streaming sound or video.
279 Say Y here if you want to be able to classify outgoing packets based
280 on their RSVP requests.
282 To compile this code as a module, choose M here: the
283 module will be called cls_rsvp.
286 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
289 The Resource Reservation Protocol (RSVP) permits end systems to
290 request a minimum and maximum data flow rate for a connection; this
291 is important for real time data such as streaming sound or video.
293 Say Y here if you want to be able to classify outgoing packets based
294 on their RSVP requests and you are using the IPv6 protocol.
296 To compile this code as a module, choose M here: the
297 module will be called cls_rsvp6.
300 tristate "Flow classifier"
303 If you say Y here, you will be able to classify packets based on
304 a configurable combination of packet keys. This is mostly useful
305 in combination with SFQ.
307 To compile this code as a module, choose M here: the
308 module will be called cls_flow.
311 bool "Extended Matches"
314 Say Y here if you want to use extended matches on top of classifiers
315 and select the extended matches below.
317 Extended matches are small classification helpers not worth writing
318 a separate classifier for.
320 A recent version of the iproute2 package is required to use
323 config NET_EMATCH_STACK
325 depends on NET_EMATCH
328 Size of the local stack variable used while evaluating the tree of
329 ematches. Limits the depth of the tree, i.e. the number of
330 encapsulated precedences. Every level requires 4 bytes of additional
333 config NET_EMATCH_CMP
334 tristate "Simple packet data comparison"
335 depends on NET_EMATCH
337 Say Y here if you want to be able to classify packets based on
338 simple packet data comparisons for 8, 16, and 32bit values.
340 To compile this code as a module, choose M here: the
341 module will be called em_cmp.
343 config NET_EMATCH_NBYTE
344 tristate "Multi byte comparison"
345 depends on NET_EMATCH
347 Say Y here if you want to be able to classify packets based on
348 multiple byte comparisons mainly useful for IPv6 address comparisons.
350 To compile this code as a module, choose M here: the
351 module will be called em_nbyte.
353 config NET_EMATCH_U32
355 depends on NET_EMATCH
357 Say Y here if you want to be able to classify packets using
358 the famous u32 key in combination with logic relations.
360 To compile this code as a module, choose M here: the
361 module will be called em_u32.
363 config NET_EMATCH_META
365 depends on NET_EMATCH
367 Say Y here if you want to be able to classify packets based on
368 metadata such as load average, netfilter attributes, socket
369 attributes and routing decisions.
371 To compile this code as a module, choose M here: the
372 module will be called em_meta.
374 config NET_EMATCH_TEXT
375 tristate "Textsearch"
376 depends on NET_EMATCH
378 select TEXTSEARCH_KMP
380 select TEXTSEARCH_FSM
382 Say Y here if you want to be able to classify packets based on
383 textsearch comparisons.
385 To compile this code as a module, choose M here: the
386 module will be called em_text.
391 Say Y here if you want to use traffic control actions. Actions
392 get attached to classifiers and are invoked after a successful
393 classification. They are used to overwrite the classification
394 result, instantly drop or redirect packets, etc.
396 A recent version of the iproute2 package is required to use
399 config NET_ACT_POLICE
400 tristate "Traffic Policing"
401 depends on NET_CLS_ACT
403 Say Y here if you want to do traffic policing, i.e. strict
404 bandwidth limiting. This action replaces the existing policing
407 To compile this code as a module, choose M here: the
408 module will be called police.
411 tristate "Generic actions"
412 depends on NET_CLS_ACT
414 Say Y here to take generic actions such as dropping and
417 To compile this code as a module, choose M here: the
418 module will be called gact.
421 bool "Probability support"
422 depends on NET_ACT_GACT
424 Say Y here to use the generic action randomly or deterministically.
426 config NET_ACT_MIRRED
427 tristate "Redirecting and Mirroring"
428 depends on NET_CLS_ACT
430 Say Y here to allow packets to be mirrored or redirected to
433 To compile this code as a module, choose M here: the
434 module will be called mirred.
437 tristate "IPtables targets"
438 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
440 Say Y here to be able to invoke iptables targets after successful
443 To compile this code as a module, choose M here: the
444 module will be called ipt.
447 tristate "Stateless NAT"
448 depends on NET_CLS_ACT
450 Say Y here to do stateless NAT on IPv4 packets. You should use
451 netfilter for NAT unless you know what you are doing.
453 To compile this code as a module, choose M here: the
454 module will be called nat.
457 tristate "Packet Editing"
458 depends on NET_CLS_ACT
460 Say Y here if you want to mangle the content of packets.
462 To compile this code as a module, choose M here: the
463 module will be called pedit.
466 tristate "Simple Example (Debug)"
467 depends on NET_CLS_ACT
469 Say Y here to add a simple action for demonstration purposes.
470 It is meant as an example and for debugging purposes. It will
471 print a configured policy string followed by the packet count
472 to the console for every packet that passes by.
476 To compile this code as a module, choose M here: the
477 module will be called simple.
480 bool "Incoming device classification"
481 depends on NET_CLS_U32 || NET_CLS_FW
483 Say Y here to extend the u32 and fw classifier to support
484 classification based on the incoming device. This option is
485 likely to disappear in favour of the metadata ematch.