2 # Traffic control configuration.
5 prompt "Packet scheduler clock source"
7 default NET_SCH_CLK_JIFFIES
9 Packet schedulers need a monotonic clock that increments at a static
10 rate. The kernel provides several suitable interfaces, each with
13 - high resolution (us or better)
14 - fast to read (minimal locking, no i/o access)
15 - synchronized on all processors
16 - handles cpu clock frequency changes
18 but nothing provides all of the above.
20 config NET_SCH_CLK_JIFFIES
21 bool "Timer interrupt"
23 Say Y here if you want to use the timer interrupt (jiffies) as clock
24 source. This clock source is fast, synchronized on all processors and
25 handles cpu clock frequency changes, but its resolution is too low
26 for accurate shaping except at very low speed.
28 config NET_SCH_CLK_GETTIMEOFDAY
31 Say Y here if you want to use gettimeofday as clock source. This clock
32 source has high resolution, is synchronized on all processors and
33 handles cpu clock frequency changes, but it is slow.
35 Choose this if you need a high resolution clock source but can't use
36 the CPU's cycle counter.
38 config NET_SCH_CLK_CPU
39 bool "CPU cycle counter"
40 depends on X86_TSC || X86_64 || ALPHA || SPARC64 || PPC64 || IA64
42 Say Y here if you want to use the CPU's cycle counter as clock source.
43 This is a cheap and high resolution clock source, but on some
44 architectures it is not synchronized on all processors and doesn't
45 handle cpu clock frequency changes.
47 The useable cycle counters are:
49 x86/x86_64 - Timestamp Counter
51 sparc64 - %ticks register
53 ia64 - Interval Time Counter
55 Choose this if your CPU's cycle counter is working properly.
60 tristate "CBQ packet scheduler"
63 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
64 scheduling algorithm for some of your network devices. This
65 algorithm classifies the waiting packets into a tree-like hierarchy
66 of classes; the leaves of this tree are in turn scheduled by
67 separate algorithms (called "disciplines" in this context).
69 See the top of <file:net/sched/sch_cbq.c> for references about the
72 CBQ is a commonly used scheduler, so if you're unsure, you should
73 say Y here. Then say Y to all the queueing algorithms below that you
74 want to use as CBQ disciplines. Then say Y to "Packet classifier
75 API" and say Y to all the classifiers you want to use; a classifier
76 is a routine that allows you to sort your outgoing traffic into
77 classes based on a certain criterion.
79 To compile this code as a module, choose M here: the
80 module will be called sch_cbq.
83 tristate "HTB packet scheduler"
86 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
87 packet scheduling algorithm for some of your network devices. See
88 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
91 HTB is very similar to the CBQ regarding its goals however is has
92 different properties and different algorithm.
94 To compile this code as a module, choose M here: the
95 module will be called sch_htb.
98 tristate "HFSC packet scheduler"
101 Say Y here if you want to use the Hierarchical Fair Service Curve
102 (HFSC) packet scheduling algorithm for some of your network devices.
104 To compile this code as a module, choose M here: the
105 module will be called sch_hfsc.
107 #tristate ' H-PFQ packet scheduler' CONFIG_NET_SCH_HPFQ
109 tristate "ATM pseudo-scheduler"
110 depends on NET_SCHED && ATM
112 Say Y here if you want to use the ATM pseudo-scheduler. This
113 provides a framework for invoking classifiers (aka "filters"), which
114 in turn select classes of this queuing discipline. Each class maps
115 the flow(s) it is handling to a given virtual circuit (see the top of
116 <file:net/sched/sch_atm.c>).
118 To compile this code as a module, choose M here: the
119 module will be called sch_atm.
122 tristate "The simplest PRIO pseudoscheduler"
125 Say Y here if you want to use an n-band priority queue packet
126 "scheduler" for some of your network devices or as a leaf discipline
127 for the CBQ scheduling algorithm. If unsure, say Y.
129 To compile this code as a module, choose M here: the
130 module will be called sch_prio.
136 Say Y here if you want to use the Random Early Detection (RED)
137 packet scheduling algorithm for some of your network devices (see
138 the top of <file:net/sched/sch_red.c> for details and references
139 about the algorithm).
141 To compile this code as a module, choose M here: the
142 module will be called sch_red.
148 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
149 packet scheduling algorithm for some of your network devices or as a
150 leaf discipline for the CBQ scheduling algorithm (see the top of
151 <file:net/sched/sch_sfq.c> for details and references about the SFQ
154 To compile this code as a module, choose M here: the
155 module will be called sch_sfq.
158 tristate "TEQL queue"
161 Say Y here if you want to use the True Link Equalizer (TLE) packet
162 scheduling algorithm for some of your network devices or as a leaf
163 discipline for the CBQ scheduling algorithm. This queueing
164 discipline allows the combination of several physical devices into
165 one virtual device. (see the top of <file:net/sched/sch_teql.c> for
168 To compile this code as a module, choose M here: the
169 module will be called sch_teql.
175 Say Y here if you want to use the Simple Token Bucket Filter (TBF)
176 packet scheduling algorithm for some of your network devices or as a
177 leaf discipline for the CBQ scheduling algorithm (see the top of
178 <file:net/sched/sch_tbf.c> for a description of the TBF algorithm).
180 To compile this code as a module, choose M here: the
181 module will be called sch_tbf.
184 tristate "GRED queue"
187 Say Y here if you want to use the Generic Random Early Detection
188 (RED) packet scheduling algorithm for some of your network devices
189 (see the top of <file:net/sched/sch_red.c> for details and
190 references about the algorithm).
192 To compile this code as a module, choose M here: the
193 module will be called sch_gred.
195 config NET_SCH_DSMARK
196 tristate "Diffserv field marker"
199 Say Y if you want to schedule packets according to the
200 Differentiated Services architecture proposed in RFC 2475.
201 Technical information on this method, with pointers to associated
202 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
204 To compile this code as a module, choose M here: the
205 module will be called sch_dsmark.
208 tristate "Network emulator"
211 Say Y if you want to emulate network delay, loss, and packet
212 re-ordering. This is often useful to simulate networks when
213 testing applications or protocols.
215 To compile this driver as a module, choose M here: the module
216 will be called sch_netem.
220 config NET_SCH_INGRESS
221 tristate "Ingress Qdisc"
224 If you say Y here, you will be able to police incoming bandwidth
225 and drop packets when this bandwidth exceeds your desired rate.
228 To compile this code as a module, choose M here: the
229 module will be called sch_ingress.
235 Say Y here if you want to include Quality Of Service scheduling
236 features, which means that you will be able to request certain
237 rate-of-flow limits for your network devices.
239 This Quality of Service (QoS) support will enable you to use
240 Differentiated Services (diffserv) and Resource Reservation Protocol
241 (RSVP) on your Linux router if you also say Y to "Packet classifier
242 API" and to some classifiers below. Documentation and software is at
243 <http://diffserv.sourceforge.net/>.
245 Note that the answer to this question won't directly affect the
246 kernel: saying N will just cause the configurator to skip all
247 the questions about QoS support.
250 bool "Rate estimator"
253 In order for Quality of Service scheduling to work, the current
254 rate-of-flow for a network device has to be estimated; if you say Y
255 here, the kernel will do just that.
258 bool "Packet classifier API"
261 The CBQ scheduling algorithm requires that network packets which are
262 scheduled to be sent out over a network device be classified
263 according to some criterion. If you say Y here, you will get a
264 choice of several different packet classifiers with the following
267 This will enable you to use Differentiated Services (diffserv) and
268 Resource Reservation Protocol (RSVP) on your Linux router.
269 Documentation and software is at
270 <http://diffserv.sourceforge.net/>.
272 config NET_CLS_TCINDEX
273 tristate "TC index classifier"
276 If you say Y here, you will be able to classify outgoing packets
277 according to the tc_index field of the skb. You will want this
278 feature if you want to implement Differentiated Services using
279 sch_dsmark. If unsure, say Y.
281 To compile this code as a module, choose M here: the
282 module will be called cls_tcindex.
284 config NET_CLS_ROUTE4
285 tristate "Routing table based classifier"
289 If you say Y here, you will be able to classify outgoing packets
290 according to the route table entry they matched. If unsure, say Y.
292 To compile this code as a module, choose M here: the
293 module will be called cls_route.
300 tristate "Firewall based classifier"
303 If you say Y here, you will be able to classify outgoing packets
304 according to firewall criteria you specified.
306 To compile this code as a module, choose M here: the
307 module will be called cls_fw.
310 tristate "U32 classifier"
313 If you say Y here, you will be able to classify outgoing packets
314 according to their destination address. If unsure, say Y.
316 To compile this code as a module, choose M here: the
317 module will be called cls_u32.
320 bool "U32 classifier performance counters"
321 depends on NET_CLS_U32
323 gathers stats that could be used to tune u32 classifier performance.
324 Requires a new iproute2
325 You MUST NOT turn this on if you dont have an update iproute2.
328 bool "classify input device (slows things u32/fw) "
329 depends on NET_CLS_U32 || NET_CLS_FW
331 This option will be killed eventually when a
332 metadata action appears because it slows things a little
333 Available only for u32 and fw classifiers.
334 Requires a new iproute2
335 You MUST NOT turn this on if you dont have an update iproute2.
338 tristate "Special RSVP classifier"
339 depends on NET_CLS && NET_QOS
341 The Resource Reservation Protocol (RSVP) permits end systems to
342 request a minimum and maximum data flow rate for a connection; this
343 is important for real time data such as streaming sound or video.
345 Say Y here if you want to be able to classify outgoing packets based
346 on their RSVP requests.
348 To compile this code as a module, choose M here: the
349 module will be called cls_rsvp.
352 tristate "Special RSVP classifier for IPv6"
353 depends on NET_CLS && NET_QOS
355 The Resource Reservation Protocol (RSVP) permits end systems to
356 request a minimum and maximum data flow rate for a connection; this
357 is important for real time data such as streaming sound or video.
359 Say Y here if you want to be able to classify outgoing packets based
360 on their RSVP requests and you are using the new Internet Protocol
361 IPv6 as opposed to the older and more common IPv4.
363 To compile this code as a module, choose M here: the
364 module will be called cls_rsvp6.
368 depends on EXPERIMENTAL && NET_CLS && NET_QOS
370 This option requires you have a new iproute2. It enables
371 tc extensions which can be used with tc classifiers.
372 Only the u32 and fw classifiers are supported at the moment.
373 You MUST NOT turn this on if you dont have an update iproute2.
375 config NET_ACT_POLICE
376 tristate "Policing Actions"
377 depends on NET_CLS_ACT
379 If you are using a newer iproute2 select this one, otherwise use one
380 below to select a policer.
381 You MUST NOT turn this on if you dont have an update iproute2.
383 config NET_CLS_POLICE
384 bool "Traffic policing (needed for in/egress)"
385 depends on NET_CLS && NET_QOS && NET_ACT_POLICE!=y && NET_ACT_POLICE!=m
387 Say Y to support traffic policing (bandwidth limits). Needed for
388 ingress and egress rate limiting.
391 tristate "generic Actions"
392 depends on NET_CLS_ACT
394 You must have new iproute2 to use this feature.
395 This adds simple filtering actions like drop, accept etc.
398 bool "generic Actions probability"
399 depends on NET_ACT_GACT
401 Allows generic actions to be randomly or deterministically used.
403 config NET_ACT_MIRRED
404 tristate "Packet In/Egress redirecton/mirror Actions"
405 depends on NET_CLS_ACT
407 requires new iproute2
408 This allows packets to be mirrored or redirected to netdevices
411 tristate "iptables Actions"
412 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
414 requires new iproute2
415 This allows iptables targets to be used by tc filters
418 tristate "Generic Packet Editor Actions"
419 depends on NET_CLS_ACT
421 requires new iproute2
422 This allows for packets to be generically edited