2 # Traffic control configuration.
5 menu "QoS and/or fair queueing"
8 bool "QoS and/or fair queueing"
10 When the kernel has several packets to send out over a network
11 device, it has to decide which ones to send first, which ones to
12 delay, and which ones to drop. This is the job of the queueing
13 disciplines, several different algorithms for how to do this
14 "fairly" have been proposed.
16 If you say N here, you will get the standard packet scheduler, which
17 is a FIFO (first come, first served). If you say Y here, you will be
18 able to choose from among several alternative algorithms which can
19 then be attached to different network devices. This is useful for
20 example if some of your network devices are real time devices that
21 need a certain minimum data flow rate, or if you need to limit the
22 maximum data flow rate for traffic which matches specified criteria.
23 This code is considered to be experimental.
25 To administer these schedulers, you'll need the user-level utilities
26 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
27 That package also contains some documentation; for more, check out
28 <http://linux-net.osdl.org/index.php/Iproute2>.
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
32 (RSVP) on your Linux router if you also say Y to the corresponding
33 classifiers below. Documentation and software is at
34 <http://diffserv.sourceforge.net/>.
36 If you say Y here and to "/proc file system" below, you will be able
37 to read status information about packet schedulers from the file
40 The available schedulers are listed in the following questions; you
41 can say Y to as many as you like. If unsure, say N now.
44 prompt "Packet scheduler clock source"
46 default NET_SCH_CLK_JIFFIES
48 Packet schedulers need a monotonic clock that increments at a static
49 rate. The kernel provides several suitable interfaces, each with
52 - high resolution (us or better)
53 - fast to read (minimal locking, no i/o access)
54 - synchronized on all processors
55 - handles cpu clock frequency changes
57 but nothing provides all of the above.
59 config NET_SCH_CLK_JIFFIES
60 bool "Timer interrupt"
62 Say Y here if you want to use the timer interrupt (jiffies) as clock
63 source. This clock source is fast, synchronized on all processors and
64 handles cpu clock frequency changes, but its resolution is too low
65 for accurate shaping except at very low speed.
67 config NET_SCH_CLK_GETTIMEOFDAY
70 Say Y here if you want to use gettimeofday as clock source. This clock
71 source has high resolution, is synchronized on all processors and
72 handles cpu clock frequency changes, but it is slow.
74 Choose this if you need a high resolution clock source but can't use
75 the CPU's cycle counter.
77 # don't allow on SMP x86 because they can have unsynchronized TSCs.
78 # gettimeofday is a good alternative
79 config NET_SCH_CLK_CPU
80 bool "CPU cycle counter"
81 depends on ((X86_TSC || X86_64) && !SMP) || ALPHA || SPARC64 || PPC64 || IA64
83 Say Y here if you want to use the CPU's cycle counter as clock source.
84 This is a cheap and high resolution clock source, but on some
85 architectures it is not synchronized on all processors and doesn't
86 handle cpu clock frequency changes.
88 The useable cycle counters are:
90 x86/x86_64 - Timestamp Counter
92 sparc64 - %ticks register
94 ia64 - Interval Time Counter
96 Choose this if your CPU's cycle counter is working properly.
100 comment "Queueing/Scheduling"
104 tristate "Class Based Queueing (CBQ)"
107 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
108 scheduling algorithm. This algorithm classifies the waiting packets
109 into a tree-like hierarchy of classes; the leaves of this tree are
110 in turn scheduled by separate algorithms.
112 See the top of <file:net/sched/sch_cbq.c> for more details.
114 CBQ is a commonly used scheduler, so if you're unsure, you should
115 say Y here. Then say Y to all the queueing algorithms below that you
116 want to use as leaf disciplines.
118 To compile this code as a module, choose M here: the
119 module will be called sch_cbq.
122 tristate "Hierarchical Token Bucket (HTB)"
125 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
126 packet scheduling algorithm. See
127 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
130 HTB is very similar to CBQ regarding its goals however is has
131 different properties and different algorithm.
133 To compile this code as a module, choose M here: the
134 module will be called sch_htb.
137 tristate "Hierarchical Fair Service Curve (HFSC)"
140 Say Y here if you want to use the Hierarchical Fair Service Curve
141 (HFSC) packet scheduling algorithm.
143 To compile this code as a module, choose M here: the
144 module will be called sch_hfsc.
147 tristate "ATM Virtual Circuits (ATM)"
148 depends on NET_SCHED && ATM
150 Say Y here if you want to use the ATM pseudo-scheduler. This
151 provides a framework for invoking classifiers, which in turn
152 select classes of this queuing discipline. Each class maps
153 the flow(s) it is handling to a given virtual circuit.
155 See the top of <file:net/sched/sch_atm.c>) for more details.
157 To compile this code as a module, choose M here: the
158 module will be called sch_atm.
161 tristate "Multi Band Priority Queueing (PRIO)"
164 Say Y here if you want to use an n-band priority queue packet
167 To compile this code as a module, choose M here: the
168 module will be called sch_prio.
171 tristate "Random Early Detection (RED)"
174 Say Y here if you want to use the Random Early Detection (RED)
175 packet scheduling algorithm.
177 See the top of <file:net/sched/sch_red.c> for more details.
179 To compile this code as a module, choose M here: the
180 module will be called sch_red.
183 tristate "Stochastic Fairness Queueing (SFQ)"
186 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
187 packet scheduling algorithm .
189 See the top of <file:net/sched/sch_sfq.c> for more details.
191 To compile this code as a module, choose M here: the
192 module will be called sch_sfq.
195 tristate "True Link Equalizer (TEQL)"
198 Say Y here if you want to use the True Link Equalizer (TLE) packet
199 scheduling algorithm. This queueing discipline allows the combination
200 of several physical devices into one virtual device.
202 See the top of <file:net/sched/sch_teql.c> for more details.
204 To compile this code as a module, choose M here: the
205 module will be called sch_teql.
208 tristate "Token Bucket Filter (TBF)"
211 Say Y here if you want to use the Token Bucket Filter (TBF) packet
212 scheduling algorithm.
214 See the top of <file:net/sched/sch_tbf.c> for more details.
216 To compile this code as a module, choose M here: the
217 module will be called sch_tbf.
220 tristate "Generic Random Early Detection (GRED)"
223 Say Y here if you want to use the Generic Random Early Detection
224 (GRED) packet scheduling algorithm for some of your network devices
225 (see the top of <file:net/sched/sch_red.c> for details and
226 references about the algorithm).
228 To compile this code as a module, choose M here: the
229 module will be called sch_gred.
231 config NET_SCH_DSMARK
232 tristate "Differentiated Services marker (DSMARK)"
235 Say Y if you want to schedule packets according to the
236 Differentiated Services architecture proposed in RFC 2475.
237 Technical information on this method, with pointers to associated
238 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
240 To compile this code as a module, choose M here: the
241 module will be called sch_dsmark.
244 tristate "Network emulator (NETEM)"
247 Say Y if you want to emulate network delay, loss, and packet
248 re-ordering. This is often useful to simulate networks when
249 testing applications or protocols.
251 To compile this driver as a module, choose M here: the module
252 will be called sch_netem.
256 config NET_SCH_INGRESS
257 tristate "Ingress Qdisc"
260 Say Y here if you want to use classifiers for incoming packets.
263 To compile this code as a module, choose M here: the
264 module will be called sch_ingress.
266 comment "Classification"
273 tristate "Elementary classification (BASIC)"
277 Say Y here if you want to be able to classify packets using
278 only extended matches and actions.
280 To compile this code as a module, choose M here: the
281 module will be called cls_basic.
283 config NET_CLS_TCINDEX
284 tristate "Traffic-Control Index (TCINDEX)"
288 Say Y here if you want to be able to classify packets based on
289 traffic control indices. You will want this feature if you want
290 to implement Differentiated Services together with DSMARK.
292 To compile this code as a module, choose M here: the
293 module will be called cls_tcindex.
295 config NET_CLS_ROUTE4
296 tristate "Routing decision (ROUTE)"
301 If you say Y here, you will be able to classify packets
302 according to the route table entry they matched.
304 To compile this code as a module, choose M here: the
305 module will be called cls_route.
312 tristate "Netfilter mark (FW)"
316 If you say Y here, you will be able to classify packets
317 according to netfilter/firewall marks.
319 To compile this code as a module, choose M here: the
320 module will be called cls_fw.
323 tristate "Universal 32bit comparisons w/ hashing (U32)"
327 Say Y here to be able to classify packetes using a universal
328 32bit pieces based comparison scheme.
330 To compile this code as a module, choose M here: the
331 module will be called cls_u32.
334 bool "Performance counters support"
335 depends on NET_CLS_U32
337 Say Y here to make u32 gather additional statistics useful for
338 fine tuning u32 classifiers.
341 bool "Netfilter marks support"
342 depends on NET_CLS_U32 && NETFILTER
344 Say Y here to be able to use netfilter marks as u32 key.
347 tristate "IPv4 Resource Reservation Protocol (RSVP)"
352 The Resource Reservation Protocol (RSVP) permits end systems to
353 request a minimum and maximum data flow rate for a connection; this
354 is important for real time data such as streaming sound or video.
356 Say Y here if you want to be able to classify outgoing packets based
357 on their RSVP requests.
359 To compile this code as a module, choose M here: the
360 module will be called cls_rsvp.
363 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
368 The Resource Reservation Protocol (RSVP) permits end systems to
369 request a minimum and maximum data flow rate for a connection; this
370 is important for real time data such as streaming sound or video.
372 Say Y here if you want to be able to classify outgoing packets based
373 on their RSVP requests and you are using the IPv6.
375 To compile this code as a module, choose M here: the
376 module will be called cls_rsvp6.
379 bool "Extended Matches"
383 Say Y here if you want to use extended matches on top of classifiers
384 and select the extended matches below.
386 Extended matches are small classification helpers not worth writing
387 a separate classifier for.
389 A recent version of the iproute2 package is required to use
392 config NET_EMATCH_STACK
394 depends on NET_EMATCH
397 Size of the local stack variable used while evaluating the tree of
398 ematches. Limits the depth of the tree, i.e. the number of
399 encapsulated precedences. Every level requires 4 bytes of additional
402 config NET_EMATCH_CMP
403 tristate "Simple packet data comparison"
404 depends on NET_EMATCH
406 Say Y here if you want to be able to classify packets based on
407 simple packet data comparisons for 8, 16, and 32bit values.
409 To compile this code as a module, choose M here: the
410 module will be called em_cmp.
412 config NET_EMATCH_NBYTE
413 tristate "Multi byte comparison"
414 depends on NET_EMATCH
416 Say Y here if you want to be able to classify packets based on
417 multiple byte comparisons mainly useful for IPv6 address comparisons.
419 To compile this code as a module, choose M here: the
420 module will be called em_nbyte.
422 config NET_EMATCH_U32
424 depends on NET_EMATCH
426 Say Y here if you want to be able to classify packets using
427 the famous u32 key in combination with logic relations.
429 To compile this code as a module, choose M here: the
430 module will be called em_u32.
432 config NET_EMATCH_META
434 depends on NET_EMATCH
436 Say Y here if you want to be ablt to classify packets based on
437 metadata such as load average, netfilter attributes, socket
438 attributes and routing decisions.
440 To compile this code as a module, choose M here: the
441 module will be called em_meta.
443 config NET_EMATCH_TEXT
444 tristate "Textsearch"
445 depends on NET_EMATCH
447 select TEXTSEARCH_KMP
449 select TEXTSEARCH_FSM
451 Say Y here if you want to be able to classify packets based on
452 textsearch comparisons.
454 To compile this code as a module, choose M here: the
455 module will be called em_text.
459 depends on EXPERIMENTAL && NET_SCHED
462 Say Y here if you want to use traffic control actions. Actions
463 get attached to classifiers and are invoked after a successful
464 classification. They are used to overwrite the classification
465 result, instantly drop or redirect packets, etc.
467 A recent version of the iproute2 package is required to use
470 config NET_ACT_POLICE
471 tristate "Traffic Policing"
472 depends on NET_CLS_ACT
474 Say Y here if you want to do traffic policing, i.e. strict
475 bandwidth limiting. This action replaces the existing policing
478 To compile this code as a module, choose M here: the
479 module will be called police.
482 tristate "Generic actions"
483 depends on NET_CLS_ACT
485 Say Y here to take generic actions such as dropping and
488 To compile this code as a module, choose M here: the
489 module will be called gact.
492 bool "Probability support"
493 depends on NET_ACT_GACT
495 Say Y here to use the generic action randomly or deterministically.
497 config NET_ACT_MIRRED
498 tristate "Redirecting and Mirroring"
499 depends on NET_CLS_ACT
501 Say Y here to allow packets to be mirrored or redirected to
504 To compile this code as a module, choose M here: the
505 module will be called mirred.
508 tristate "IPtables targets"
509 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
511 Say Y here to be able to invoke iptables targets after succesful
514 To compile this code as a module, choose M here: the
515 module will be called ipt.
518 tristate "Packet Editing"
519 depends on NET_CLS_ACT
521 Say Y here if you want to mangle the content of packets.
523 To compile this code as a module, choose M here: the
524 module will be called pedit.
527 tristate "Simple Example (Debug)"
528 depends on NET_CLS_ACT
530 Say Y here to add a simple action for demonstration purposes.
531 It is meant as an example and for debugging purposes. It will
532 print a configured policy string followed by the packet count
533 to the console for every packet that passes by.
537 To compile this code as a module, choose M here: the
538 module will be called simple.
540 config NET_CLS_POLICE
541 bool "Traffic Policing (obsolete)"
542 depends on NET_SCHED && NET_CLS_ACT!=y
545 Say Y here if you want to do traffic policing, i.e. strict
546 bandwidth limiting. This option is obsoleted by the traffic
547 policer implemented as action, it stays here for compatibility
551 bool "Incoming device classification"
552 depends on NET_SCHED && (NET_CLS_U32 || NET_CLS_FW)
554 Say Y here to extend the u32 and fw classifier to support
555 classification based on the incoming device. This option is
556 likely to disappear in favour of the metadata ematch.
559 bool "Rate estimator"
562 Say Y here to allow using rate estimators to estimate the current
563 rate-of-flow for network devices, queues, etc. This module is
564 automaticaly selected if needed but can be selected manually for