blob: 13eeee582886d530947c0dd10cc7be8099b6d245 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#
2# Traffic control configuration.
3#
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07004
Thomas Graf52ab4ac2005-11-01 15:13:02 +01005menu "QoS and/or fair queueing"
6
7config NET_SCHED
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07008 bool "QoS and/or fair queueing"
9 ---help---
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
Thomas Graf52ab4ac2005-11-01 15:13:02 +010012 delay, and which ones to drop. This is the job of the queueing
13 disciplines, several different algorithms for how to do this
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070014 "fairly" have been proposed.
15
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.
24
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
Thomas Graf52ab4ac2005-11-01 15:13:02 +010028 <http://linux-net.osdl.org/index.php/Iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070029
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010032 (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/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070035
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
38 /proc/net/psched.
39
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.
42
Roman Zippel05b8b0f2005-11-17 15:22:39 -080043if NET_SCHED
44
Linus Torvalds1da177e2005-04-16 15:20:36 -070045choice
46 prompt "Packet scheduler clock source"
Patrick McHardydca80b92006-01-13 14:36:55 -080047 default NET_SCH_CLK_GETTIMEOFDAY
Thomas Graf52ab4ac2005-11-01 15:13:02 +010048 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 Packet schedulers need a monotonic clock that increments at a static
50 rate. The kernel provides several suitable interfaces, each with
51 different properties:
52
53 - high resolution (us or better)
54 - fast to read (minimal locking, no i/o access)
55 - synchronized on all processors
56 - handles cpu clock frequency changes
57
58 but nothing provides all of the above.
59
60config NET_SCH_CLK_JIFFIES
61 bool "Timer interrupt"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010062 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 Say Y here if you want to use the timer interrupt (jiffies) as clock
64 source. This clock source is fast, synchronized on all processors and
65 handles cpu clock frequency changes, but its resolution is too low
66 for accurate shaping except at very low speed.
67
68config NET_SCH_CLK_GETTIMEOFDAY
69 bool "gettimeofday"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010070 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 Say Y here if you want to use gettimeofday as clock source. This clock
72 source has high resolution, is synchronized on all processors and
73 handles cpu clock frequency changes, but it is slow.
74
75 Choose this if you need a high resolution clock source but can't use
76 the CPU's cycle counter.
77
Andi Kleen34cb7112005-10-13 14:41:44 -070078# don't allow on SMP x86 because they can have unsynchronized TSCs.
79# gettimeofday is a good alternative
Linus Torvalds1da177e2005-04-16 15:20:36 -070080config NET_SCH_CLK_CPU
81 bool "CPU cycle counter"
Andi Kleen34cb7112005-10-13 14:41:44 -070082 depends on ((X86_TSC || X86_64) && !SMP) || ALPHA || SPARC64 || PPC64 || IA64
Thomas Graf52ab4ac2005-11-01 15:13:02 +010083 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 Say Y here if you want to use the CPU's cycle counter as clock source.
85 This is a cheap and high resolution clock source, but on some
86 architectures it is not synchronized on all processors and doesn't
87 handle cpu clock frequency changes.
88
89 The useable cycle counters are:
90
91 x86/x86_64 - Timestamp Counter
92 alpha - Cycle Counter
93 sparc64 - %ticks register
94 ppc64 - Time base
95 ia64 - Interval Time Counter
96
97 Choose this if your CPU's cycle counter is working properly.
98
99endchoice
100
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100101comment "Queueing/Scheduling"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100102
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100104 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105 ---help---
106 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100107 scheduling algorithm. This algorithm classifies the waiting packets
108 into a tree-like hierarchy of classes; the leaves of this tree are
109 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100111 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112
113 CBQ is a commonly used scheduler, so if you're unsure, you should
114 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100115 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116
117 To compile this code as a module, choose M here: the
118 module will be called sch_cbq.
119
120config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100121 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 ---help---
123 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100124 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
126 in-depth articles.
127
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100128 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 different properties and different algorithm.
130
131 To compile this code as a module, choose M here: the
132 module will be called sch_htb.
133
134config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100135 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 ---help---
137 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100138 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
140 To compile this code as a module, choose M here: the
141 module will be called sch_hfsc.
142
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100144 tristate "ATM Virtual Circuits (ATM)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800145 depends on ATM
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146 ---help---
147 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100148 provides a framework for invoking classifiers, which in turn
149 select classes of this queuing discipline. Each class maps
150 the flow(s) it is handling to a given virtual circuit.
151
152 See the top of <file:net/sched/sch_atm.c>) for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153
154 To compile this code as a module, choose M here: the
155 module will be called sch_atm.
156
157config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100158 tristate "Multi Band Priority Queueing (PRIO)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100159 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100161 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162
163 To compile this code as a module, choose M here: the
164 module will be called sch_prio.
165
166config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100167 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100168 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100170 packet scheduling algorithm.
171
172 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173
174 To compile this code as a module, choose M here: the
175 module will be called sch_red.
176
177config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100178 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 ---help---
180 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100181 packet scheduling algorithm .
182
183 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184
185 To compile this code as a module, choose M here: the
186 module will be called sch_sfq.
187
188config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100189 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 ---help---
191 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100192 scheduling algorithm. This queueing discipline allows the combination
193 of several physical devices into one virtual device.
194
195 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196
197 To compile this code as a module, choose M here: the
198 module will be called sch_teql.
199
200config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100201 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100202 ---help---
203 Say Y here if you want to use the Token Bucket Filter (TBF) packet
204 scheduling algorithm.
205
206 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207
208 To compile this code as a module, choose M here: the
209 module will be called sch_tbf.
210
211config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100212 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100213 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700215 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 (see the top of <file:net/sched/sch_red.c> for details and
217 references about the algorithm).
218
219 To compile this code as a module, choose M here: the
220 module will be called sch_gred.
221
222config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100223 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100224 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 Say Y if you want to schedule packets according to the
226 Differentiated Services architecture proposed in RFC 2475.
227 Technical information on this method, with pointers to associated
228 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
229
230 To compile this code as a module, choose M here: the
231 module will be called sch_dsmark.
232
233config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100234 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100235 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 Say Y if you want to emulate network delay, loss, and packet
237 re-ordering. This is often useful to simulate networks when
238 testing applications or protocols.
239
240 To compile this driver as a module, choose M here: the module
241 will be called sch_netem.
242
243 If unsure, say N.
244
245config NET_SCH_INGRESS
246 tristate "Ingress Qdisc"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100247 ---help---
248 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 If unsure, say Y.
250
251 To compile this code as a module, choose M here: the
252 module will be called sch_ingress.
253
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100254comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255
256config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100257 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258
259config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100260 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100261 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 ---help---
263 Say Y here if you want to be able to classify packets using
264 only extended matches and actions.
265
266 To compile this code as a module, choose M here: the
267 module will be called cls_basic.
268
269config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100271 select NET_CLS
272 ---help---
273 Say Y here if you want to be able to classify packets based on
274 traffic control indices. You will want this feature if you want
275 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276
277 To compile this code as a module, choose M here: the
278 module will be called cls_tcindex.
279
280config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100281 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100283 select NET_CLS
284 ---help---
285 If you say Y here, you will be able to classify packets
286 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287
288 To compile this code as a module, choose M here: the
289 module will be called cls_route.
290
291config NET_CLS_ROUTE
292 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
294config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100295 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100296 select NET_CLS
297 ---help---
298 If you say Y here, you will be able to classify packets
299 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300
301 To compile this code as a module, choose M here: the
302 module will be called cls_fw.
303
304config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100305 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100306 select NET_CLS
307 ---help---
308 Say Y here to be able to classify packetes using a universal
309 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310
311 To compile this code as a module, choose M here: the
312 module will be called cls_u32.
313
314config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100315 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100317 ---help---
318 Say Y here to make u32 gather additional statistics useful for
319 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320
321config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100322 bool "Netfilter marks support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 depends on NET_CLS_U32 && NETFILTER
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100324 ---help---
325 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326
327config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100328 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100329 select NET_CLS
330 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 ---help---
332 The Resource Reservation Protocol (RSVP) permits end systems to
333 request a minimum and maximum data flow rate for a connection; this
334 is important for real time data such as streaming sound or video.
335
336 Say Y here if you want to be able to classify outgoing packets based
337 on their RSVP requests.
338
339 To compile this code as a module, choose M here: the
340 module will be called cls_rsvp.
341
342config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100343 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100344 select NET_CLS
345 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 ---help---
347 The Resource Reservation Protocol (RSVP) permits end systems to
348 request a minimum and maximum data flow rate for a connection; this
349 is important for real time data such as streaming sound or video.
350
351 Say Y here if you want to be able to classify outgoing packets based
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100352 on their RSVP requests and you are using the IPv6.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353
354 To compile this code as a module, choose M here: the
355 module will be called cls_rsvp6.
356
357config NET_EMATCH
358 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100359 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360 ---help---
361 Say Y here if you want to use extended matches on top of classifiers
362 and select the extended matches below.
363
364 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100365 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100367 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368 extended matches.
369
370config NET_EMATCH_STACK
371 int "Stack size"
372 depends on NET_EMATCH
373 default "32"
374 ---help---
375 Size of the local stack variable used while evaluating the tree of
376 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700377 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378 stack space.
379
380config NET_EMATCH_CMP
381 tristate "Simple packet data comparison"
382 depends on NET_EMATCH
383 ---help---
384 Say Y here if you want to be able to classify packets based on
385 simple packet data comparisons for 8, 16, and 32bit values.
386
387 To compile this code as a module, choose M here: the
388 module will be called em_cmp.
389
390config NET_EMATCH_NBYTE
391 tristate "Multi byte comparison"
392 depends on NET_EMATCH
393 ---help---
394 Say Y here if you want to be able to classify packets based on
395 multiple byte comparisons mainly useful for IPv6 address comparisons.
396
397 To compile this code as a module, choose M here: the
398 module will be called em_nbyte.
399
400config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100401 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402 depends on NET_EMATCH
403 ---help---
404 Say Y here if you want to be able to classify packets using
405 the famous u32 key in combination with logic relations.
406
407 To compile this code as a module, choose M here: the
408 module will be called em_u32.
409
410config NET_EMATCH_META
411 tristate "Metadata"
412 depends on NET_EMATCH
413 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800414 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 metadata such as load average, netfilter attributes, socket
416 attributes and routing decisions.
417
418 To compile this code as a module, choose M here: the
419 module will be called em_meta.
420
Thomas Grafd675c982005-06-23 21:00:58 -0700421config NET_EMATCH_TEXT
422 tristate "Textsearch"
423 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700424 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700425 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700426 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700427 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700428 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100429 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700430 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700431
432 To compile this code as a module, choose M here: the
433 module will be called em_text.
434
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100436 bool "Actions"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100437 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100439 Say Y here if you want to use traffic control actions. Actions
440 get attached to classifiers and are invoked after a successful
441 classification. They are used to overwrite the classification
442 result, instantly drop or redirect packets, etc.
443
444 A recent version of the iproute2 package is required to use
445 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446
447config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100448 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449 depends on NET_CLS_ACT
450 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 Say Y here if you want to do traffic policing, i.e. strict
452 bandwidth limiting. This action replaces the existing policing
453 module.
454
455 To compile this code as a module, choose M here: the
456 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457
458config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100459 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 depends on NET_CLS_ACT
461 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 Say Y here to take generic actions such as dropping and
463 accepting packets.
464
465 To compile this code as a module, choose M here: the
466 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700467
468config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100469 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470 depends on NET_ACT_GACT
471 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100472 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473
474config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100475 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476 depends on NET_CLS_ACT
477 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100478 Say Y here to allow packets to be mirrored or redirected to
479 other devices.
480
481 To compile this code as a module, choose M here: the
482 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483
484config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100485 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
487 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100488 Say Y here to be able to invoke iptables targets after succesful
489 classification.
490
491 To compile this code as a module, choose M here: the
492 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493
494config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100495 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 depends on NET_CLS_ACT
497 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100498 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100500 To compile this code as a module, choose M here: the
501 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700503config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100504 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700505 depends on NET_CLS_ACT
506 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100507 Say Y here to add a simple action for demonstration purposes.
508 It is meant as an example and for debugging purposes. It will
509 print a configured policy string followed by the packet count
510 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700511
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100512 If unsure, say N.
513
514 To compile this code as a module, choose M here: the
515 module will be called simple.
516
517config NET_CLS_POLICE
518 bool "Traffic Policing (obsolete)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800519 depends on NET_CLS_ACT!=y
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100520 select NET_ESTIMATOR
521 ---help---
522 Say Y here if you want to do traffic policing, i.e. strict
523 bandwidth limiting. This option is obsoleted by the traffic
524 policer implemented as action, it stays here for compatibility
525 reasons.
526
527config NET_CLS_IND
528 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800529 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100530 ---help---
531 Say Y here to extend the u32 and fw classifier to support
532 classification based on the incoming device. This option is
533 likely to disappear in favour of the metadata ematch.
534
535config NET_ESTIMATOR
536 bool "Rate estimator"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100537 ---help---
538 Say Y here to allow using rate estimators to estimate the current
539 rate-of-flow for network devices, queues, etc. This module is
540 automaticaly selected if needed but can be selected manually for
541 statstical purposes.
542
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800543endif # NET_SCHED
544
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100545endmenu