2005-04-17 02:20:36 +04:00
#
# Traffic control configuration.
#
2005-07-12 08:13:56 +04:00
2007-10-19 08:56:38 +04:00
menuconfig NET_SCHED
2005-07-12 08:13:56 +04:00
bool "QoS and/or fair queueing"
2006-11-10 03:16:21 +03:00
select NET_SCH_FIFO
2005-07-12 08:13:56 +04:00
---help---
When the kernel has several packets to send out over a network
device, it has to decide which ones to send first, which ones to
2005-11-01 17:13:02 +03:00
delay, and which ones to drop. This is the job of the queueing
disciplines, several different algorithms for how to do this
2005-07-12 08:13:56 +04:00
"fairly" have been proposed.
If you say N here, you will get the standard packet scheduler, which
is a FIFO (first come, first served). If you say Y here, you will be
able to choose from among several alternative algorithms which can
then be attached to different network devices. This is useful for
example if some of your network devices are real time devices that
need a certain minimum data flow rate, or if you need to limit the
maximum data flow rate for traffic which matches specified criteria.
This code is considered to be experimental.
To administer these schedulers, you'll need the user-level utilities
from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
That package also contains some documentation; for more, check out
2010-11-15 22:55:34 +03:00
<http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
2005-07-12 08:13:56 +04:00
This Quality of Service (QoS) support will enable you to use
Differentiated Services (diffserv) and Resource Reservation Protocol
2005-11-01 17:13:02 +03:00
(RSVP) on your Linux router if you also say Y to the corresponding
classifiers below. Documentation and software is at
<http://diffserv.sourceforge.net/>.
2005-07-12 08:13:56 +04:00
If you say Y here and to "/proc file system" below, you will be able
to read status information about packet schedulers from the file
/proc/net/psched.
The available schedulers are listed in the following questions; you
can say Y to as many as you like. If unsure, say N now.
2005-11-18 02:22:39 +03:00
if NET_SCHED
2005-11-01 17:13:02 +03:00
comment "Queueing/Scheduling"
2005-04-17 02:20:36 +04:00
config NET_SCH_CBQ
2005-11-01 17:13:02 +03:00
tristate "Class Based Queueing (CBQ)"
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the Class-Based Queueing (CBQ) packet
2005-11-01 17:13:02 +03:00
scheduling algorithm. This algorithm classifies the waiting packets
into a tree-like hierarchy of classes; the leaves of this tree are
in turn scheduled by separate algorithms.
2005-04-17 02:20:36 +04:00
2005-11-01 17:13:02 +03:00
See the top of <file:net/sched/sch_cbq.c> for more details.
2005-04-17 02:20:36 +04:00
CBQ is a commonly used scheduler, so if you're unsure, you should
say Y here. Then say Y to all the queueing algorithms below that you
2005-11-01 17:13:02 +03:00
want to use as leaf disciplines.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_cbq.
config NET_SCH_HTB
2005-11-01 17:13:02 +03:00
tristate "Hierarchical Token Bucket (HTB)"
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the Hierarchical Token Buckets (HTB)
2005-11-01 17:13:02 +03:00
packet scheduling algorithm. See
2005-04-17 02:20:36 +04:00
<http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
in-depth articles.
2005-11-01 17:13:02 +03:00
HTB is very similar to CBQ regarding its goals however is has
2005-04-17 02:20:36 +04:00
different properties and different algorithm.
To compile this code as a module, choose M here: the
module will be called sch_htb.
config NET_SCH_HFSC
2005-11-01 17:13:02 +03:00
tristate "Hierarchical Fair Service Curve (HFSC)"
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the Hierarchical Fair Service Curve
2005-11-01 17:13:02 +03:00
(HFSC) packet scheduling algorithm.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_hfsc.
config NET_SCH_ATM
2005-11-01 17:13:02 +03:00
tristate "ATM Virtual Circuits (ATM)"
2005-11-18 02:22:39 +03:00
depends on ATM
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the ATM pseudo-scheduler. This
2005-11-01 17:13:02 +03:00
provides a framework for invoking classifiers, which in turn
select classes of this queuing discipline. Each class maps
the flow(s) it is handling to a given virtual circuit.
2007-07-18 13:00:04 +04:00
See the top of <file:net/sched/sch_atm.c> for more details.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_atm.
config NET_SCH_PRIO
2005-11-01 17:13:02 +03:00
tristate "Multi Band Priority Queueing (PRIO)"
---help---
2005-04-17 02:20:36 +04:00
Say Y here if you want to use an n-band priority queue packet
2005-11-01 17:13:02 +03:00
scheduler.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_prio.
2008-09-13 03:29:34 +04:00
config NET_SCH_MULTIQ
tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
---help---
Say Y here if you want to use an n-band queue packet scheduler
to support devices that have multiple hardware transmit queues.
To compile this code as a module, choose M here: the
module will be called sch_multiq.
2005-04-17 02:20:36 +04:00
config NET_SCH_RED
2005-11-01 17:13:02 +03:00
tristate "Random Early Detection (RED)"
---help---
2005-04-17 02:20:36 +04:00
Say Y here if you want to use the Random Early Detection (RED)
2005-11-01 17:13:02 +03:00
packet scheduling algorithm.
See the top of <file:net/sched/sch_red.c> for more details.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_red.
net_sched: SFB flow scheduler
This is the Stochastic Fair Blue scheduler, based on work from :
W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue
Management Algorithms. U. Michigan CSE-TR-387-99, April 1999.
http://www.thefengs.com/wuchang/blue/CSE-TR-387-99.pdf
This implementation is based on work done by Juliusz Chroboczek
General SFB algorithm can be found in figure 14, page 15:
B[l][n] : L x N array of bins (L levels, N bins per level)
enqueue()
Calculate hash function values h{0}, h{1}, .. h{L-1}
Update bins at each level
for i = 0 to L - 1
if (B[i][h{i}].qlen > bin_size)
B[i][h{i}].p_mark += p_increment;
else if (B[i][h{i}].qlen == 0)
B[i][h{i}].p_mark -= p_decrement;
p_min = min(B[0][h{0}].p_mark ... B[L-1][h{L-1}].p_mark);
if (p_min == 1.0)
ratelimit();
else
mark/drop with probabilty p_min;
I did the adaptation of Juliusz code to meet current kernel standards,
and various changes to address previous comments :
http://thread.gmane.org/gmane.linux.network/90225
http://thread.gmane.org/gmane.linux.network/90375
Default flow classifier is the rxhash introduced by RPS in 2.6.35, but
we can use an external flow classifier if wanted.
tc qdisc add dev $DEV parent 1:11 handle 11: \
est 0.5sec 2sec sfb limit 128
tc filter add dev $DEV protocol ip parent 11: handle 3 \
flow hash keys dst divisor 1024
Notes:
1) SFB default child qdisc is pfifo_fast. It can be changed by another
qdisc but a child qdisc MUST not drop a packet previously queued. This
is because SFB needs to handle a dequeued packet in order to maintain
its virtual queue states. pfifo_head_drop or CHOKe should not be used.
2) ECN is enabled by default, unlike RED/CHOKe/GRED
With help from Patrick McHardy & Andi Kleen
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
CC: Juliusz Chroboczek <Juliusz.Chroboczek@pps.jussieu.fr>
CC: Stephen Hemminger <shemminger@vyatta.com>
CC: Patrick McHardy <kaber@trash.net>
CC: Andi Kleen <andi@firstfloor.org>
CC: John W. Linville <linville@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-23 13:56:17 +03:00
config NET_SCH_SFB
tristate "Stochastic Fair Blue (SFB)"
---help---
Say Y here if you want to use the Stochastic Fair Blue (SFB)
packet scheduling algorithm.
See the top of <file:net/sched/sch_sfb.c> for more details.
To compile this code as a module, choose M here: the
module will be called sch_sfb.
2005-04-17 02:20:36 +04:00
config NET_SCH_SFQ
2005-11-01 17:13:02 +03:00
tristate "Stochastic Fairness Queueing (SFQ)"
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
2007-07-18 13:00:04 +04:00
packet scheduling algorithm.
2005-11-01 17:13:02 +03:00
See the top of <file:net/sched/sch_sfq.c> for more details.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_sfq.
config NET_SCH_TEQL
2005-11-01 17:13:02 +03:00
tristate "True Link Equalizer (TEQL)"
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use the True Link Equalizer (TLE) packet
2005-11-01 17:13:02 +03:00
scheduling algorithm. This queueing discipline allows the combination
of several physical devices into one virtual device.
See the top of <file:net/sched/sch_teql.c> for more details.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_teql.
config NET_SCH_TBF
2005-11-01 17:13:02 +03:00
tristate "Token Bucket Filter (TBF)"
---help---
Say Y here if you want to use the Token Bucket Filter (TBF) packet
scheduling algorithm.
See the top of <file:net/sched/sch_tbf.c> for more details.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called sch_tbf.
config NET_SCH_GRED
2005-11-01 17:13:02 +03:00
tristate "Generic Random Early Detection (GRED)"
---help---
2005-04-17 02:20:36 +04:00
Say Y here if you want to use the Generic Random Early Detection
2005-05-04 01:34:20 +04:00
(GRED) packet scheduling algorithm for some of your network devices
2005-04-17 02:20:36 +04:00
(see the top of <file:net/sched/sch_red.c> for details and
references about the algorithm).
To compile this code as a module, choose M here: the
module will be called sch_gred.
config NET_SCH_DSMARK
2005-11-01 17:13:02 +03:00
tristate "Differentiated Services marker (DSMARK)"
---help---
2005-04-17 02:20:36 +04:00
Say Y if you want to schedule packets according to the
Differentiated Services architecture proposed in RFC 2475.
Technical information on this method, with pointers to associated
RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
To compile this code as a module, choose M here: the
module will be called sch_dsmark.
config NET_SCH_NETEM
2005-11-01 17:13:02 +03:00
tristate "Network emulator (NETEM)"
---help---
2005-04-17 02:20:36 +04:00
Say Y if you want to emulate network delay, loss, and packet
re-ordering. This is often useful to simulate networks when
testing applications or protocols.
To compile this driver as a module, choose M here: the module
will be called sch_netem.
If unsure, say N.
2008-11-20 15:10:00 +03:00
config NET_SCH_DRR
tristate "Deficit Round Robin scheduler (DRR)"
help
Say Y here if you want to use the Deficit Round Robin (DRR) packet
scheduling algorithm.
To compile this driver as a module, choose M here: the module
will be called sch_drr.
If unsure, say N.
2011-01-17 11:06:09 +03:00
config NET_SCH_MQPRIO
tristate "Multi-queue priority scheduler (MQPRIO)"
help
Say Y here if you want to use the Multi-queue Priority scheduler.
This scheduler allows QOS to be offloaded on NICs that have support
for offloading QOS schedulers.
To compile this driver as a module, choose M here: the module will
be called sch_mqprio.
If unsure, say N.
2011-02-02 18:21:10 +03:00
config NET_SCH_CHOKE
tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
help
Say Y here if you want to use the CHOKe packet scheduler (CHOose
and Keep for responsive flows, CHOose and Kill for unresponsive
flows). This is a variation of RED which trys to penalize flows
that monopolize the queue.
To compile this code as a module, choose M here: the
module will be called sch_choke.
2011-04-04 09:30:58 +04:00
config NET_SCH_QFQ
tristate "Quick Fair Queueing scheduler (QFQ)"
help
Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
packet scheduling algorithm.
To compile this driver as a module, choose M here: the module
will be called sch_qfq.
If unsure, say N.
codel: Controlled Delay AQM
An implementation of CoDel AQM, from Kathleen Nichols and Van Jacobson.
http://queue.acm.org/detail.cfm?id=2209336
This AQM main input is no longer queue size in bytes or packets, but the
delay packets stay in (FIFO) queue.
As we don't have infinite memory, we still can drop packets in enqueue()
in case of massive load, but mean of CoDel is to drop packets in
dequeue(), using a control law based on two simple parameters :
target : target sojourn time (default 5ms)
interval : width of moving time window (default 100ms)
Based on initial work from Dave Taht.
Refactored to help future codel inclusion as a plugin for other linux
qdisc (FQ_CODEL, ...), like RED.
include/net/codel.h contains codel algorithm as close as possible than
Kathleen reference.
net/sched/sch_codel.c contains the linux qdisc specific glue.
Separate structures permit a memory efficient implementation of fq_codel
(to be sent as a separate work) : Each flow has its own struct
codel_vars.
timestamps are taken at enqueue() time with 1024 ns precision, allowing
a range of 2199 seconds in queue, and 100Gb links support. iproute2 uses
usec as base unit.
Selected packets are dropped, unless ECN is enabled and packets can get
ECN mark instead.
Tested from 2Mb to 10Gb speeds with no particular problems, on ixgbe and
tg3 drivers (BQL enabled).
Usage: tc qdisc ... codel [ limit PACKETS ] [ target TIME ]
[ interval TIME ] [ ecn ]
qdisc codel 10: parent 1:1 limit 2000p target 3.0ms interval 60.0ms ecn
Sent 13347099587 bytes 8815805 pkt (dropped 0, overlimits 0 requeues 0)
rate 202365Kbit 16708pps backlog 113550b 75p requeues 0
count 116 lastcount 98 ldelay 4.3ms dropping drop_next 816us
maxpacket 1514 ecn_mark 84399 drop_overlimit 0
CoDel must be seen as a base module, and should be used keeping in mind
there is still a FIFO queue. So a typical setup will probably need a
hierarchy of several qdiscs and packet classifiers to be able to meet
whatever constraints a user might have.
One possible example would be to use fq_codel, which combines Fair
Queueing and CoDel, in replacement of sfq / sfq_red.
Signed-off-by: Eric Dumazet <edumazet@google.com>
Signed-off-by: Dave Taht <dave.taht@bufferbloat.net>
Cc: Kathleen Nichols <nichols@pollere.com>
Cc: Van Jacobson <van@pollere.net>
Cc: Tom Herbert <therbert@google.com>
Cc: Matt Mathis <mattmathis@google.com>
Cc: Yuchung Cheng <ycheng@google.com>
Cc: Stephen Hemminger <shemminger@vyatta.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-05-10 11:51:25 +04:00
config NET_SCH_CODEL
tristate "Controlled Delay AQM (CODEL)"
help
Say Y here if you want to use the Controlled Delay (CODEL)
packet scheduling algorithm.
To compile this driver as a module, choose M here: the module
will be called sch_codel.
If unsure, say N.
2005-04-17 02:20:36 +04:00
config NET_SCH_INGRESS
tristate "Ingress Qdisc"
2008-02-01 03:57:15 +03:00
depends on NET_CLS_ACT
2005-11-01 17:13:02 +03:00
---help---
Say Y here if you want to use classifiers for incoming packets.
2005-04-17 02:20:36 +04:00
If unsure, say Y.
To compile this code as a module, choose M here: the
module will be called sch_ingress.
2012-02-05 17:51:32 +04:00
config NET_SCH_PLUG
tristate "Plug network traffic until release (PLUG)"
---help---
This queuing discipline allows userspace to plug/unplug a network
output queue, using the netlink interface. When it receives an
enqueue command it inserts a plug into the outbound queue that
causes following packets to enqueue until a dequeue command arrives
over netlink, causing the plug to be removed and resuming the normal
packet flow.
This module also provides a generic "network output buffering"
functionality (aka output commit), wherein upon arrival of a dequeue
command, only packets up to the first plug are released for delivery.
The Remus HA project uses this module to enable speculative execution
of virtual machines by allowing the generated network output to be rolled
back if needed.
For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
Say Y here if you are using this kernel for Xen dom0 and
want to protect Xen guests with Remus.
To compile this code as a module, choose M here: the
module will be called sch_plug.
2005-11-01 17:13:02 +03:00
comment "Classification"
2005-04-17 02:20:36 +04:00
config NET_CLS
2005-11-01 17:13:02 +03:00
boolean
2005-04-17 02:20:36 +04:00
config NET_CLS_BASIC
2005-11-01 17:13:02 +03:00
tristate "Elementary classification (BASIC)"
select NET_CLS
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to be able to classify packets using
only extended matches and actions.
To compile this code as a module, choose M here: the
module will be called cls_basic.
config NET_CLS_TCINDEX
2005-11-01 17:13:02 +03:00
tristate "Traffic-Control Index (TCINDEX)"
select NET_CLS
---help---
Say Y here if you want to be able to classify packets based on
traffic control indices. You will want this feature if you want
to implement Differentiated Services together with DSMARK.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called cls_tcindex.
config NET_CLS_ROUTE4
2005-11-01 17:13:02 +03:00
tristate "Routing decision (ROUTE)"
2011-05-20 03:23:28 +04:00
depends on INET
2011-01-14 15:36:42 +03:00
select IP_ROUTE_CLASSID
2005-11-01 17:13:02 +03:00
select NET_CLS
---help---
If you say Y here, you will be able to classify packets
according to the route table entry they matched.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called cls_route.
config NET_CLS_FW
2005-11-01 17:13:02 +03:00
tristate "Netfilter mark (FW)"
select NET_CLS
---help---
If you say Y here, you will be able to classify packets
according to netfilter/firewall marks.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called cls_fw.
config NET_CLS_U32
2005-11-01 17:13:02 +03:00
tristate "Universal 32bit comparisons w/ hashing (U32)"
select NET_CLS
---help---
2006-06-30 20:53:46 +04:00
Say Y here to be able to classify packets using a universal
2005-11-01 17:13:02 +03:00
32bit pieces based comparison scheme.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called cls_u32.
config CLS_U32_PERF
2005-11-01 17:13:02 +03:00
bool "Performance counters support"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_U32
2005-11-01 17:13:02 +03:00
---help---
Say Y here to make u32 gather additional statistics useful for
fine tuning u32 classifiers.
2005-04-17 02:20:36 +04:00
config CLS_U32_MARK
2005-11-01 17:13:02 +03:00
bool "Netfilter marks support"
2006-11-10 02:19:14 +03:00
depends on NET_CLS_U32
2005-11-01 17:13:02 +03:00
---help---
Say Y here to be able to use netfilter marks as u32 key.
2005-04-17 02:20:36 +04:00
config NET_CLS_RSVP
2005-11-01 17:13:02 +03:00
tristate "IPv4 Resource Reservation Protocol (RSVP)"
select NET_CLS
2005-04-17 02:20:36 +04:00
---help---
The Resource Reservation Protocol (RSVP) permits end systems to
request a minimum and maximum data flow rate for a connection; this
is important for real time data such as streaming sound or video.
Say Y here if you want to be able to classify outgoing packets based
on their RSVP requests.
To compile this code as a module, choose M here: the
module will be called cls_rsvp.
config NET_CLS_RSVP6
2005-11-01 17:13:02 +03:00
tristate "IPv6 Resource Reservation Protocol (RSVP6)"
select NET_CLS
2005-04-17 02:20:36 +04:00
---help---
The Resource Reservation Protocol (RSVP) permits end systems to
request a minimum and maximum data flow rate for a connection; this
is important for real time data such as streaming sound or video.
Say Y here if you want to be able to classify outgoing packets based
2007-07-18 13:00:04 +04:00
on their RSVP requests and you are using the IPv6 protocol.
2005-04-17 02:20:36 +04:00
To compile this code as a module, choose M here: the
module will be called cls_rsvp6.
[NET_SCHED]: Add flow classifier
Add new "flow" classifier, which is meant to extend the SFQ hashing
capabilities without hard-coding new hash functions and also allows
deterministic mappings of keys to classes, replacing some out of tree
iptables patches like IPCLASSIFY (maps IPs to classes), IPMARK (maps
IPs to marks, with fw filters to classes), ...
Some examples:
- Classic SFQ hash:
tc filter add ... flow hash \
keys src,dst,proto,proto-src,proto-dst divisor 1024
- Classic SFQ hash, but using information from conntrack to work properly in
combination with NAT:
tc filter add ... flow hash \
keys nfct-src,nfct-dst,proto,nfct-proto-src,nfct-proto-dst divisor 1024
- Map destination IPs of 192.168.0.0/24 to classids 1-257:
tc filter add ... flow map \
key dst addend -192.168.0.0 divisor 256
- alternatively:
tc filter add ... flow map \
key dst and 0xff
- similar, but reverse ordered:
tc filter add ... flow map \
key dst and 0xff xor 0xff
Perturbation is currently not supported because we can't reliable kill the
timer on destruction.
Signed-off-by: Patrick McHardy <kaber@trash.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-02-01 05:37:42 +03:00
config NET_CLS_FLOW
tristate "Flow classifier"
select NET_CLS
---help---
If you say Y here, you will be able to classify packets based on
a configurable combination of packet keys. This is mostly useful
in combination with SFQ.
To compile this code as a module, choose M here: the
module will be called cls_flow.
2008-11-08 09:56:00 +03:00
config NET_CLS_CGROUP
2010-03-23 08:24:03 +03:00
tristate "Control Group Classifier"
2008-11-08 09:56:00 +03:00
select NET_CLS
depends on CGROUPS
---help---
Say Y here if you want to classify packets based on the control
cgroup of their process.
2010-03-23 08:24:03 +03:00
To compile this code as a module, choose M here: the
module will be called cls_cgroup.
2005-04-17 02:20:36 +04:00
config NET_EMATCH
bool "Extended Matches"
2005-11-01 17:13:02 +03:00
select NET_CLS
2005-04-17 02:20:36 +04:00
---help---
Say Y here if you want to use extended matches on top of classifiers
and select the extended matches below.
Extended matches are small classification helpers not worth writing
2005-11-01 17:13:02 +03:00
a separate classifier for.
2005-04-17 02:20:36 +04:00
2005-11-01 17:13:02 +03:00
A recent version of the iproute2 package is required to use
2005-04-17 02:20:36 +04:00
extended matches.
config NET_EMATCH_STACK
int "Stack size"
depends on NET_EMATCH
default "32"
---help---
Size of the local stack variable used while evaluating the tree of
ematches. Limits the depth of the tree, i.e. the number of
2005-06-09 02:10:22 +04:00
encapsulated precedences. Every level requires 4 bytes of additional
2005-04-17 02:20:36 +04:00
stack space.
config NET_EMATCH_CMP
tristate "Simple packet data comparison"
depends on NET_EMATCH
---help---
Say Y here if you want to be able to classify packets based on
simple packet data comparisons for 8, 16, and 32bit values.
To compile this code as a module, choose M here: the
module will be called em_cmp.
config NET_EMATCH_NBYTE
tristate "Multi byte comparison"
depends on NET_EMATCH
---help---
Say Y here if you want to be able to classify packets based on
multiple byte comparisons mainly useful for IPv6 address comparisons.
To compile this code as a module, choose M here: the
module will be called em_nbyte.
config NET_EMATCH_U32
2005-11-01 17:13:02 +03:00
tristate "U32 key"
2005-04-17 02:20:36 +04:00
depends on NET_EMATCH
---help---
Say Y here if you want to be able to classify packets using
the famous u32 key in combination with logic relations.
To compile this code as a module, choose M here: the
module will be called em_u32.
config NET_EMATCH_META
tristate "Metadata"
depends on NET_EMATCH
---help---
2006-01-12 03:40:30 +03:00
Say Y here if you want to be able to classify packets based on
2005-04-17 02:20:36 +04:00
metadata such as load average, netfilter attributes, socket
attributes and routing decisions.
To compile this code as a module, choose M here: the
module will be called em_meta.
2005-06-24 08:00:58 +04:00
config NET_EMATCH_TEXT
tristate "Textsearch"
depends on NET_EMATCH
2005-06-24 10:55:41 +04:00
select TEXTSEARCH
2005-06-25 04:39:03 +04:00
select TEXTSEARCH_KMP
2005-08-26 03:23:11 +04:00
select TEXTSEARCH_BM
2005-06-25 04:39:03 +04:00
select TEXTSEARCH_FSM
2005-06-24 08:00:58 +04:00
---help---
2005-11-01 17:13:02 +03:00
Say Y here if you want to be able to classify packets based on
2005-06-25 04:39:03 +04:00
textsearch comparisons.
2005-06-24 08:00:58 +04:00
To compile this code as a module, choose M here: the
module will be called em_text.
2005-04-17 02:20:36 +04:00
config NET_CLS_ACT
2005-11-01 17:13:02 +03:00
bool "Actions"
2005-04-17 02:20:36 +04:00
---help---
2005-11-01 17:13:02 +03:00
Say Y here if you want to use traffic control actions. Actions
get attached to classifiers and are invoked after a successful
classification. They are used to overwrite the classification
result, instantly drop or redirect packets, etc.
A recent version of the iproute2 package is required to use
extended matches.
2005-04-17 02:20:36 +04:00
config NET_ACT_POLICE
2005-11-01 17:13:02 +03:00
tristate "Traffic Policing"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_ACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here if you want to do traffic policing, i.e. strict
bandwidth limiting. This action replaces the existing policing
module.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_police.
2005-04-17 02:20:36 +04:00
config NET_ACT_GACT
2005-11-01 17:13:02 +03:00
tristate "Generic actions"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_ACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here to take generic actions such as dropping and
accepting packets.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_gact.
2005-04-17 02:20:36 +04:00
config GACT_PROB
2005-11-01 17:13:02 +03:00
bool "Probability support"
2005-04-17 02:20:36 +04:00
depends on NET_ACT_GACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here to use the generic action randomly or deterministically.
2005-04-17 02:20:36 +04:00
config NET_ACT_MIRRED
2005-11-01 17:13:02 +03:00
tristate "Redirecting and Mirroring"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_ACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here to allow packets to be mirrored or redirected to
other devices.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_mirred.
2005-04-17 02:20:36 +04:00
config NET_ACT_IPT
2005-11-01 17:13:02 +03:00
tristate "IPtables targets"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
---help---
2006-06-30 20:53:46 +04:00
Say Y here to be able to invoke iptables targets after successful
2005-11-01 17:13:02 +03:00
classification.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_ipt.
2005-04-17 02:20:36 +04:00
2007-09-27 23:48:05 +04:00
config NET_ACT_NAT
tristate "Stateless NAT"
depends on NET_CLS_ACT
---help---
Say Y here to do stateless NAT on IPv4 packets. You should use
netfilter for NAT unless you know what you are doing.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_nat.
2007-09-27 23:48:05 +04:00
2005-04-17 02:20:36 +04:00
config NET_ACT_PEDIT
2005-11-01 17:13:02 +03:00
tristate "Packet Editing"
2005-04-17 02:20:36 +04:00
depends on NET_CLS_ACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here if you want to mangle the content of packets.
2005-04-17 02:20:36 +04:00
2005-11-01 17:13:02 +03:00
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_pedit.
2005-04-17 02:20:36 +04:00
2005-04-25 07:10:16 +04:00
config NET_ACT_SIMP
2005-11-01 17:13:02 +03:00
tristate "Simple Example (Debug)"
2005-04-25 07:10:16 +04:00
depends on NET_CLS_ACT
---help---
2005-11-01 17:13:02 +03:00
Say Y here to add a simple action for demonstration purposes.
It is meant as an example and for debugging purposes. It will
print a configured policy string followed by the packet count
to the console for every packet that passes by.
If unsure, say N.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_simple.
2005-11-01 17:13:02 +03:00
2008-09-13 03:30:20 +04:00
config NET_ACT_SKBEDIT
tristate "SKB Editing"
depends on NET_CLS_ACT
---help---
Say Y here to change skb priority or queue_mapping settings.
If unsure, say N.
To compile this code as a module, choose M here: the
2010-02-09 09:41:44 +03:00
module will be called act_skbedit.
2008-09-13 03:30:20 +04:00
2010-08-18 17:10:35 +04:00
config NET_ACT_CSUM
tristate "Checksum Updating"
2010-08-24 07:42:11 +04:00
depends on NET_CLS_ACT && INET
2010-08-18 17:10:35 +04:00
---help---
Say Y here to update some common checksum after some direct
packet alterations.
To compile this code as a module, choose M here: the
module will be called act_csum.
2005-11-01 17:13:02 +03:00
config NET_CLS_IND
bool "Incoming device classification"
2005-11-18 02:22:39 +03:00
depends on NET_CLS_U32 || NET_CLS_FW
2005-11-01 17:13:02 +03:00
---help---
Say Y here to extend the u32 and fw classifier to support
classification based on the incoming device. This option is
likely to disappear in favour of the metadata ematch.
2005-11-18 02:22:39 +03:00
endif # NET_SCHED
2007-10-19 08:56:38 +04:00
config NET_SCH_FIFO
bool