2 # Traffic control configuration.
6 bool "QoS and/or fair queueing"
8 When the kernel has several packets to send out over a network
9 device, it has to decide which ones to send first, which ones to
10 delay, and which ones to drop. This is the job of the packet
11 scheduler, and several different algorithms for how to do this
12 "fairly" have been proposed.
14 If you say N here, you will get the standard packet scheduler, which
15 is a FIFO (first come, first served). If you say Y here, you will be
16 able to choose from among several alternative algorithms which can
17 then be attached to different network devices. This is useful for
18 example if some of your network devices are real time devices that
19 need a certain minimum data flow rate, or if you need to limit the
20 maximum data flow rate for traffic which matches specified criteria.
21 This code is considered to be experimental.
23 To administer these schedulers, you'll need the user-level utilities
24 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
25 That package also contains some documentation; for more, check out
26 <http://snafu.freedom.org/linux2.2/iproute-notes.html>.
28 This Quality of Service (QoS) support will enable you to use
29 Differentiated Services (diffserv) and Resource Reservation Protocol
30 (RSVP) on your Linux router if you also say Y to "QoS support",
31 "Packet classifier API" and to some classifiers below. Documentation
32 and software is at <http://diffserv.sourceforge.net/>.
34 If you say Y here and to "/proc file system" below, you will be able
35 to read status information about packet schedulers from the file
38 The available schedulers are listed in the following questions; you
39 can say Y to as many as you like. If unsure, say N now.
42 prompt "Packet scheduler clock source"
44 default NET_SCH_CLK_JIFFIES
46 Packet schedulers need a monotonic clock that increments at a static
47 rate. The kernel provides several suitable interfaces, each with
50 - high resolution (us or better)
51 - fast to read (minimal locking, no i/o access)
52 - synchronized on all processors
53 - handles cpu clock frequency changes
55 but nothing provides all of the above.
57 config NET_SCH_CLK_JIFFIES
58 bool "Timer interrupt"
60 Say Y here if you want to use the timer interrupt (jiffies) as clock
61 source. This clock source is fast, synchronized on all processors and
62 handles cpu clock frequency changes, but its resolution is too low
63 for accurate shaping except at very low speed.
65 config NET_SCH_CLK_GETTIMEOFDAY
68 Say Y here if you want to use gettimeofday as clock source. This clock
69 source has high resolution, is synchronized on all processors and
70 handles cpu clock frequency changes, but it is slow.
72 Choose this if you need a high resolution clock source but can't use
73 the CPU's cycle counter.
75 # don't allow on SMP x86 because they can have unsynchronized TSCs.
76 # gettimeofday is a good alternative
77 config NET_SCH_CLK_CPU
78 bool "CPU cycle counter"
79 depends on ((X86_TSC || X86_64) && !SMP) || ALPHA || SPARC64 || PPC64 || IA64
81 Say Y here if you want to use the CPU's cycle counter as clock source.
82 This is a cheap and high resolution clock source, but on some
83 architectures it is not synchronized on all processors and doesn't
84 handle cpu clock frequency changes.
86 The useable cycle counters are:
88 x86/x86_64 - Timestamp Counter
90 sparc64 - %ticks register
92 ia64 - Interval Time Counter
94 Choose this if your CPU's cycle counter is working properly.
99 tristate "CBQ packet scheduler"
102 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
103 scheduling algorithm for some of your network devices. This
104 algorithm classifies the waiting packets into a tree-like hierarchy
105 of classes; the leaves of this tree are in turn scheduled by
106 separate algorithms (called "disciplines" in this context).
108 See the top of <file:net/sched/sch_cbq.c> for references about the
111 CBQ is a commonly used scheduler, so if you're unsure, you should
112 say Y here. Then say Y to all the queueing algorithms below that you
113 want to use as CBQ disciplines. Then say Y to "Packet classifier
114 API" and say Y to all the classifiers you want to use; a classifier
115 is a routine that allows you to sort your outgoing traffic into
116 classes based on a certain criterion.
118 To compile this code as a module, choose M here: the
119 module will be called sch_cbq.
122 tristate "HTB packet scheduler"
125 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
126 packet scheduling algorithm for some of your network devices. See
127 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
130 HTB is very similar to the 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 "HFSC packet scheduler"
140 Say Y here if you want to use the Hierarchical Fair Service Curve
141 (HFSC) packet scheduling algorithm for some of your network devices.
143 To compile this code as a module, choose M here: the
144 module will be called sch_hfsc.
146 #tristate ' H-PFQ packet scheduler' CONFIG_NET_SCH_HPFQ
148 tristate "ATM pseudo-scheduler"
149 depends on NET_SCHED && ATM
151 Say Y here if you want to use the ATM pseudo-scheduler. This
152 provides a framework for invoking classifiers (aka "filters"), which
153 in turn select classes of this queuing discipline. Each class maps
154 the flow(s) it is handling to a given virtual circuit (see the top of
155 <file:net/sched/sch_atm.c>).
157 To compile this code as a module, choose M here: the
158 module will be called sch_atm.
161 tristate "The simplest PRIO pseudoscheduler"
164 Say Y here if you want to use an n-band priority queue packet
165 "scheduler" for some of your network devices or as a leaf discipline
166 for the CBQ scheduling algorithm. If unsure, say Y.
168 To compile this code as a module, choose M here: the
169 module will be called sch_prio.
175 Say Y here if you want to use the Random Early Detection (RED)
176 packet scheduling algorithm for some of your network devices (see
177 the top of <file:net/sched/sch_red.c> for details and references
178 about the algorithm).
180 To compile this code as a module, choose M here: the
181 module will be called sch_red.
187 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
188 packet scheduling algorithm for some of your network devices or as a
189 leaf discipline for the CBQ scheduling algorithm (see the top of
190 <file:net/sched/sch_sfq.c> for details and references about the SFQ
193 To compile this code as a module, choose M here: the
194 module will be called sch_sfq.
197 tristate "TEQL queue"
200 Say Y here if you want to use the True Link Equalizer (TLE) packet
201 scheduling algorithm for some of your network devices or as a leaf
202 discipline for the CBQ scheduling algorithm. This queueing
203 discipline allows the combination of several physical devices into
204 one virtual device. (see the top of <file:net/sched/sch_teql.c> for
207 To compile this code as a module, choose M here: the
208 module will be called sch_teql.
214 Say Y here if you want to use the Simple Token Bucket Filter (TBF)
215 packet scheduling algorithm for some of your network devices or as a
216 leaf discipline for the CBQ scheduling algorithm (see the top of
217 <file:net/sched/sch_tbf.c> for a description of the TBF algorithm).
219 To compile this code as a module, choose M here: the
220 module will be called sch_tbf.
223 tristate "GRED queue"
226 Say Y here if you want to use the Generic Random Early Detection
227 (GRED) packet scheduling algorithm for some of your network devices
228 (see the top of <file:net/sched/sch_red.c> for details and
229 references about the algorithm).
231 To compile this code as a module, choose M here: the
232 module will be called sch_gred.
234 config NET_SCH_DSMARK
235 tristate "Diffserv field marker"
238 Say Y if you want to schedule packets according to the
239 Differentiated Services architecture proposed in RFC 2475.
240 Technical information on this method, with pointers to associated
241 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
243 To compile this code as a module, choose M here: the
244 module will be called sch_dsmark.
247 tristate "Network emulator"
250 Say Y if you want to emulate network delay, loss, and packet
251 re-ordering. This is often useful to simulate networks when
252 testing applications or protocols.
254 To compile this driver as a module, choose M here: the module
255 will be called sch_netem.
259 config NET_SCH_INGRESS
260 tristate "Ingress Qdisc"
263 If you say Y here, you will be able to police incoming bandwidth
264 and drop packets when this bandwidth exceeds your desired rate.
267 To compile this code as a module, choose M here: the
268 module will be called sch_ingress.
274 Say Y here if you want to include Quality Of Service scheduling
275 features, which means that you will be able to request certain
276 rate-of-flow limits for your network devices.
278 This Quality of Service (QoS) support will enable you to use
279 Differentiated Services (diffserv) and Resource Reservation Protocol
280 (RSVP) on your Linux router if you also say Y to "Packet classifier
281 API" and to some classifiers below. Documentation and software is at
282 <http://diffserv.sourceforge.net/>.
284 Note that the answer to this question won't directly affect the
285 kernel: saying N will just cause the configurator to skip all
286 the questions about QoS support.
289 bool "Rate estimator"
292 In order for Quality of Service scheduling to work, the current
293 rate-of-flow for a network device has to be estimated; if you say Y
294 here, the kernel will do just that.
297 bool "Packet classifier API"
300 The CBQ scheduling algorithm requires that network packets which are
301 scheduled to be sent out over a network device be classified
302 according to some criterion. If you say Y here, you will get a
303 choice of several different packet classifiers with the following
306 This will enable you to use Differentiated Services (diffserv) and
307 Resource Reservation Protocol (RSVP) on your Linux router.
308 Documentation and software is at
309 <http://diffserv.sourceforge.net/>.
312 tristate "Basic classifier"
315 Say Y here if you want to be able to classify packets using
316 only extended matches and actions.
318 To compile this code as a module, choose M here: the
319 module will be called cls_basic.
321 config NET_CLS_TCINDEX
322 tristate "TC index classifier"
325 If you say Y here, you will be able to classify outgoing packets
326 according to the tc_index field of the skb. You will want this
327 feature if you want to implement Differentiated Services using
328 sch_dsmark. If unsure, say Y.
330 To compile this code as a module, choose M here: the
331 module will be called cls_tcindex.
333 config NET_CLS_ROUTE4
334 tristate "Routing table based classifier"
338 If you say Y here, you will be able to classify outgoing packets
339 according to the route table entry they matched. If unsure, say Y.
341 To compile this code as a module, choose M here: the
342 module will be called cls_route.
349 tristate "Firewall based classifier"
352 If you say Y here, you will be able to classify outgoing packets
353 according to firewall criteria you specified.
355 To compile this code as a module, choose M here: the
356 module will be called cls_fw.
359 tristate "U32 classifier"
362 If you say Y here, you will be able to classify outgoing packets
363 according to their destination address. If unsure, say Y.
365 To compile this code as a module, choose M here: the
366 module will be called cls_u32.
369 bool "U32 classifier performance counters"
370 depends on NET_CLS_U32
372 gathers stats that could be used to tune u32 classifier performance.
373 Requires a new iproute2
374 You MUST NOT turn this on if you dont have an update iproute2.
377 bool "classify input device (slows things u32/fw) "
378 depends on NET_CLS_U32 || NET_CLS_FW
380 This option will be killed eventually when a
381 metadata action appears because it slows things a little
382 Available only for u32 and fw classifiers.
383 Requires a new iproute2
384 You MUST NOT turn this on if you dont have an update iproute2.
387 bool "Use nfmark as a key in U32 classifier"
388 depends on NET_CLS_U32 && NETFILTER
390 This allows you to match mark in a u32 filter.
392 tc filter add dev eth0 protocol ip parent 1:0 prio 5 u32 \
393 match mark 0x0090 0xffff \
394 match ip dst 4.4.4.4 \
396 You must use a new iproute2 to use this feature.
399 tristate "Special RSVP classifier"
400 depends on NET_CLS && NET_QOS
402 The Resource Reservation Protocol (RSVP) permits end systems to
403 request a minimum and maximum data flow rate for a connection; this
404 is important for real time data such as streaming sound or video.
406 Say Y here if you want to be able to classify outgoing packets based
407 on their RSVP requests.
409 To compile this code as a module, choose M here: the
410 module will be called cls_rsvp.
413 tristate "Special RSVP classifier for IPv6"
414 depends on NET_CLS && NET_QOS
416 The Resource Reservation Protocol (RSVP) permits end systems to
417 request a minimum and maximum data flow rate for a connection; this
418 is important for real time data such as streaming sound or video.
420 Say Y here if you want to be able to classify outgoing packets based
421 on their RSVP requests and you are using the new Internet Protocol
422 IPv6 as opposed to the older and more common IPv4.
424 To compile this code as a module, choose M here: the
425 module will be called cls_rsvp6.
428 bool "Extended Matches"
431 Say Y here if you want to use extended matches on top of classifiers
432 and select the extended matches below.
434 Extended matches are small classification helpers not worth writing
435 a separate classifier.
437 You must have a recent version of the iproute2 tools in order to use
440 config NET_EMATCH_STACK
442 depends on NET_EMATCH
445 Size of the local stack variable used while evaluating the tree of
446 ematches. Limits the depth of the tree, i.e. the number of
447 encapsulated precedences. Every level requires 4 bytes of additional
450 config NET_EMATCH_CMP
451 tristate "Simple packet data comparison"
452 depends on NET_EMATCH
454 Say Y here if you want to be able to classify packets based on
455 simple packet data comparisons for 8, 16, and 32bit values.
457 To compile this code as a module, choose M here: the
458 module will be called em_cmp.
460 config NET_EMATCH_NBYTE
461 tristate "Multi byte comparison"
462 depends on NET_EMATCH
464 Say Y here if you want to be able to classify packets based on
465 multiple byte comparisons mainly useful for IPv6 address comparisons.
467 To compile this code as a module, choose M here: the
468 module will be called em_nbyte.
470 config NET_EMATCH_U32
471 tristate "U32 hashing key"
472 depends on NET_EMATCH
474 Say Y here if you want to be able to classify packets using
475 the famous u32 key in combination with logic relations.
477 To compile this code as a module, choose M here: the
478 module will be called em_u32.
480 config NET_EMATCH_META
482 depends on NET_EMATCH
484 Say Y here if you want to be ablt to classify packets based on
485 metadata such as load average, netfilter attributes, socket
486 attributes and routing decisions.
488 To compile this code as a module, choose M here: the
489 module will be called em_meta.
491 config NET_EMATCH_TEXT
492 tristate "Textsearch"
493 depends on NET_EMATCH
495 select TEXTSEARCH_KMP
497 select TEXTSEARCH_FSM
499 Say Y here if you want to be ablt to classify packets based on
500 textsearch comparisons.
502 To compile this code as a module, choose M here: the
503 module will be called em_text.
507 depends on EXPERIMENTAL && NET_CLS && NET_QOS
509 This option requires you have a new iproute2. It enables
510 tc extensions which can be used with tc classifiers.
511 You MUST NOT turn this on if you dont have an update iproute2.
513 config NET_ACT_POLICE
514 tristate "Policing Actions"
515 depends on NET_CLS_ACT
517 If you are using a newer iproute2 select this one, otherwise use one
518 below to select a policer.
519 You MUST NOT turn this on if you dont have an update iproute2.
522 tristate "generic Actions"
523 depends on NET_CLS_ACT
525 You must have new iproute2 to use this feature.
526 This adds simple filtering actions like drop, accept etc.
529 bool "generic Actions probability"
530 depends on NET_ACT_GACT
532 Allows generic actions to be randomly or deterministically used.
534 config NET_ACT_MIRRED
535 tristate "Packet In/Egress redirecton/mirror Actions"
536 depends on NET_CLS_ACT
538 requires new iproute2
539 This allows packets to be mirrored or redirected to netdevices
542 tristate "iptables Actions"
543 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
545 requires new iproute2
546 This allows iptables targets to be used by tc filters
549 tristate "Generic Packet Editor Actions"
550 depends on NET_CLS_ACT
552 requires new iproute2
553 This allows for packets to be generically edited
555 config NET_CLS_POLICE
556 bool "Traffic policing (needed for in/egress)"
557 depends on NET_CLS && NET_QOS && NET_CLS_ACT!=y
559 Say Y to support traffic policing (bandwidth limits). Needed for
560 ingress and egress rate limiting.
563 tristate "Simple action"
564 depends on NET_CLS_ACT
566 You must have new iproute2 to use this feature.
567 This adds a very simple action for demonstration purposes
568 The idea is to give action authors a basic example to look at.
569 All this action will do is print on the console the configured
570 policy string followed by _ then packet count.