Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | # |
| 2 | # Traffic control configuration. |
| 3 | # |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 4 | |
Randy Dunlap | 85ef3e5 | 2007-10-18 21:56:38 -0700 | [diff] [blame] | 5 | menuconfig NET_SCHED |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 6 | bool "QoS and/or fair queueing" |
David Kimdon | 3c62f75 | 2006-11-09 16:16:21 -0800 | [diff] [blame] | 7 | select NET_SCH_FIFO |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 8 | ---help--- |
| 9 | When the kernel has several packets to send out over a network |
| 10 | device, it has to decide which ones to send first, which ones to |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 11 | delay, and which ones to drop. This is the job of the queueing |
| 12 | disciplines, several different algorithms for how to do this |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 13 | "fairly" have been proposed. |
| 14 | |
| 15 | If you say N here, you will get the standard packet scheduler, which |
| 16 | is a FIFO (first come, first served). If you say Y here, you will be |
| 17 | able to choose from among several alternative algorithms which can |
| 18 | then be attached to different network devices. This is useful for |
| 19 | example if some of your network devices are real time devices that |
| 20 | need a certain minimum data flow rate, or if you need to limit the |
| 21 | maximum data flow rate for traffic which matches specified criteria. |
| 22 | This code is considered to be experimental. |
| 23 | |
| 24 | To administer these schedulers, you'll need the user-level utilities |
| 25 | from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>. |
| 26 | That package also contains some documentation; for more, check out |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 27 | <http://linux-net.osdl.org/index.php/Iproute2>. |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 28 | |
| 29 | This Quality of Service (QoS) support will enable you to use |
| 30 | Differentiated Services (diffserv) and Resource Reservation Protocol |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 31 | (RSVP) on your Linux router if you also say Y to the corresponding |
| 32 | classifiers below. Documentation and software is at |
| 33 | <http://diffserv.sourceforge.net/>. |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 34 | |
| 35 | If you say Y here and to "/proc file system" below, you will be able |
| 36 | to read status information about packet schedulers from the file |
| 37 | /proc/net/psched. |
| 38 | |
| 39 | The available schedulers are listed in the following questions; you |
| 40 | can say Y to as many as you like. If unsure, say N now. |
| 41 | |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 42 | if NET_SCHED |
| 43 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 44 | comment "Queueing/Scheduling" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 45 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 46 | config NET_SCH_CBQ |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 47 | tristate "Class Based Queueing (CBQ)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 48 | ---help--- |
| 49 | Say Y here if you want to use the Class-Based Queueing (CBQ) packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 50 | scheduling algorithm. This algorithm classifies the waiting packets |
| 51 | into a tree-like hierarchy of classes; the leaves of this tree are |
| 52 | in turn scheduled by separate algorithms. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 53 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 54 | See the top of <file:net/sched/sch_cbq.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 55 | |
| 56 | CBQ is a commonly used scheduler, so if you're unsure, you should |
| 57 | say Y here. Then say Y to all the queueing algorithms below that you |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 58 | want to use as leaf disciplines. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 59 | |
| 60 | To compile this code as a module, choose M here: the |
| 61 | module will be called sch_cbq. |
| 62 | |
| 63 | config NET_SCH_HTB |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 64 | tristate "Hierarchical Token Bucket (HTB)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 65 | ---help--- |
| 66 | Say Y here if you want to use the Hierarchical Token Buckets (HTB) |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 67 | packet scheduling algorithm. See |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 68 | <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and |
| 69 | in-depth articles. |
| 70 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 71 | HTB is very similar to CBQ regarding its goals however is has |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 72 | different properties and different algorithm. |
| 73 | |
| 74 | To compile this code as a module, choose M here: the |
| 75 | module will be called sch_htb. |
| 76 | |
| 77 | config NET_SCH_HFSC |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 78 | tristate "Hierarchical Fair Service Curve (HFSC)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 79 | ---help--- |
| 80 | Say Y here if you want to use the Hierarchical Fair Service Curve |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 81 | (HFSC) packet scheduling algorithm. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 82 | |
| 83 | To compile this code as a module, choose M here: the |
| 84 | module will be called sch_hfsc. |
| 85 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 86 | config NET_SCH_ATM |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 87 | tristate "ATM Virtual Circuits (ATM)" |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 88 | depends on ATM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 89 | ---help--- |
| 90 | Say Y here if you want to use the ATM pseudo-scheduler. This |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 91 | provides a framework for invoking classifiers, which in turn |
| 92 | select classes of this queuing discipline. Each class maps |
| 93 | the flow(s) it is handling to a given virtual circuit. |
| 94 | |
Gabriel Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 95 | See the top of <file:net/sched/sch_atm.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 96 | |
| 97 | To compile this code as a module, choose M here: the |
| 98 | module will be called sch_atm. |
| 99 | |
| 100 | config NET_SCH_PRIO |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 101 | tristate "Multi Band Priority Queueing (PRIO)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 102 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 103 | Say Y here if you want to use an n-band priority queue packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 104 | scheduler. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 105 | |
| 106 | To compile this code as a module, choose M here: the |
| 107 | module will be called sch_prio. |
| 108 | |
Peter P Waskiewicz Jr | d62733c | 2007-06-28 21:04:31 -0700 | [diff] [blame] | 109 | config NET_SCH_RR |
| 110 | tristate "Multi Band Round Robin Queuing (RR)" |
| 111 | select NET_SCH_PRIO |
| 112 | ---help--- |
| 113 | Say Y here if you want to use an n-band round robin packet |
| 114 | scheduler. |
| 115 | |
| 116 | The module uses sch_prio for its framework and is aliased as |
| 117 | sch_rr, so it will load sch_prio, although it is referred |
| 118 | to using sch_rr. |
| 119 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 120 | config NET_SCH_RED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 121 | tristate "Random Early Detection (RED)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 122 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 123 | Say Y here if you want to use the Random Early Detection (RED) |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 124 | packet scheduling algorithm. |
| 125 | |
| 126 | See the top of <file:net/sched/sch_red.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 127 | |
| 128 | To compile this code as a module, choose M here: the |
| 129 | module will be called sch_red. |
| 130 | |
| 131 | config NET_SCH_SFQ |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 132 | tristate "Stochastic Fairness Queueing (SFQ)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 133 | ---help--- |
| 134 | Say Y here if you want to use the Stochastic Fairness Queueing (SFQ) |
Gabriel Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 135 | packet scheduling algorithm. |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 136 | |
| 137 | See the top of <file:net/sched/sch_sfq.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 138 | |
| 139 | To compile this code as a module, choose M here: the |
| 140 | module will be called sch_sfq. |
| 141 | |
| 142 | config NET_SCH_TEQL |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 143 | tristate "True Link Equalizer (TEQL)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 144 | ---help--- |
| 145 | Say Y here if you want to use the True Link Equalizer (TLE) packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 146 | scheduling algorithm. This queueing discipline allows the combination |
| 147 | of several physical devices into one virtual device. |
| 148 | |
| 149 | See the top of <file:net/sched/sch_teql.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 150 | |
| 151 | To compile this code as a module, choose M here: the |
| 152 | module will be called sch_teql. |
| 153 | |
| 154 | config NET_SCH_TBF |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 155 | tristate "Token Bucket Filter (TBF)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 156 | ---help--- |
| 157 | Say Y here if you want to use the Token Bucket Filter (TBF) packet |
| 158 | scheduling algorithm. |
| 159 | |
| 160 | See the top of <file:net/sched/sch_tbf.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 161 | |
| 162 | To compile this code as a module, choose M here: the |
| 163 | module will be called sch_tbf. |
| 164 | |
| 165 | config NET_SCH_GRED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 166 | tristate "Generic Random Early Detection (GRED)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 167 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 168 | Say Y here if you want to use the Generic Random Early Detection |
Lucas Correia Villa Real | 20cc6be | 2005-05-03 14:34:20 -0700 | [diff] [blame] | 169 | (GRED) packet scheduling algorithm for some of your network devices |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 170 | (see the top of <file:net/sched/sch_red.c> for details and |
| 171 | references about the algorithm). |
| 172 | |
| 173 | To compile this code as a module, choose M here: the |
| 174 | module will be called sch_gred. |
| 175 | |
| 176 | config NET_SCH_DSMARK |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 177 | tristate "Differentiated Services marker (DSMARK)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 178 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 179 | Say Y if you want to schedule packets according to the |
| 180 | Differentiated Services architecture proposed in RFC 2475. |
| 181 | Technical information on this method, with pointers to associated |
| 182 | RFCs, is available at <http://www.gta.ufrj.br/diffserv/>. |
| 183 | |
| 184 | To compile this code as a module, choose M here: the |
| 185 | module will be called sch_dsmark. |
| 186 | |
| 187 | config NET_SCH_NETEM |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 188 | tristate "Network emulator (NETEM)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 189 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 190 | Say Y if you want to emulate network delay, loss, and packet |
| 191 | re-ordering. This is often useful to simulate networks when |
| 192 | testing applications or protocols. |
| 193 | |
| 194 | To compile this driver as a module, choose M here: the module |
| 195 | will be called sch_netem. |
| 196 | |
| 197 | If unsure, say N. |
| 198 | |
| 199 | config NET_SCH_INGRESS |
| 200 | tristate "Ingress Qdisc" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 201 | ---help--- |
| 202 | Say Y here if you want to use classifiers for incoming packets. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 203 | If unsure, say Y. |
| 204 | |
| 205 | To compile this code as a module, choose M here: the |
| 206 | module will be called sch_ingress. |
| 207 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 208 | comment "Classification" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 209 | |
| 210 | config NET_CLS |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 211 | boolean |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 212 | |
| 213 | config NET_CLS_BASIC |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 214 | tristate "Elementary classification (BASIC)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 215 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 216 | ---help--- |
| 217 | Say Y here if you want to be able to classify packets using |
| 218 | only extended matches and actions. |
| 219 | |
| 220 | To compile this code as a module, choose M here: the |
| 221 | module will be called cls_basic. |
| 222 | |
| 223 | config NET_CLS_TCINDEX |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 224 | tristate "Traffic-Control Index (TCINDEX)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 225 | select NET_CLS |
| 226 | ---help--- |
| 227 | Say Y here if you want to be able to classify packets based on |
| 228 | traffic control indices. You will want this feature if you want |
| 229 | to implement Differentiated Services together with DSMARK. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 230 | |
| 231 | To compile this code as a module, choose M here: the |
| 232 | module will be called cls_tcindex. |
| 233 | |
| 234 | config NET_CLS_ROUTE4 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 235 | tristate "Routing decision (ROUTE)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 236 | select NET_CLS_ROUTE |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 237 | select NET_CLS |
| 238 | ---help--- |
| 239 | If you say Y here, you will be able to classify packets |
| 240 | according to the route table entry they matched. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 241 | |
| 242 | To compile this code as a module, choose M here: the |
| 243 | module will be called cls_route. |
| 244 | |
| 245 | config NET_CLS_ROUTE |
| 246 | bool |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 247 | |
| 248 | config NET_CLS_FW |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 249 | tristate "Netfilter mark (FW)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 250 | select NET_CLS |
| 251 | ---help--- |
| 252 | If you say Y here, you will be able to classify packets |
| 253 | according to netfilter/firewall marks. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 254 | |
| 255 | To compile this code as a module, choose M here: the |
| 256 | module will be called cls_fw. |
| 257 | |
| 258 | config NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 259 | tristate "Universal 32bit comparisons w/ hashing (U32)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 260 | select NET_CLS |
| 261 | ---help--- |
Matt LaPlante | 3539c27 | 2006-06-30 18:53:46 +0200 | [diff] [blame] | 262 | Say Y here to be able to classify packets using a universal |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 263 | 32bit pieces based comparison scheme. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 264 | |
| 265 | To compile this code as a module, choose M here: the |
| 266 | module will be called cls_u32. |
| 267 | |
| 268 | config CLS_U32_PERF |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 269 | bool "Performance counters support" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 270 | depends on NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 271 | ---help--- |
| 272 | Say Y here to make u32 gather additional statistics useful for |
| 273 | fine tuning u32 classifiers. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 274 | |
| 275 | config CLS_U32_MARK |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 276 | bool "Netfilter marks support" |
Thomas Graf | 82e91ff | 2006-11-09 15:19:14 -0800 | [diff] [blame] | 277 | depends on NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 278 | ---help--- |
| 279 | Say Y here to be able to use netfilter marks as u32 key. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 280 | |
| 281 | config NET_CLS_RSVP |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 282 | tristate "IPv4 Resource Reservation Protocol (RSVP)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 283 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 284 | ---help--- |
| 285 | The Resource Reservation Protocol (RSVP) permits end systems to |
| 286 | request a minimum and maximum data flow rate for a connection; this |
| 287 | is important for real time data such as streaming sound or video. |
| 288 | |
| 289 | Say Y here if you want to be able to classify outgoing packets based |
| 290 | on their RSVP requests. |
| 291 | |
| 292 | To compile this code as a module, choose M here: the |
| 293 | module will be called cls_rsvp. |
| 294 | |
| 295 | config NET_CLS_RSVP6 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 296 | tristate "IPv6 Resource Reservation Protocol (RSVP6)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 297 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 298 | ---help--- |
| 299 | The Resource Reservation Protocol (RSVP) permits end systems to |
| 300 | request a minimum and maximum data flow rate for a connection; this |
| 301 | is important for real time data such as streaming sound or video. |
| 302 | |
| 303 | Say Y here if you want to be able to classify outgoing packets based |
Gabriel Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 304 | on their RSVP requests and you are using the IPv6 protocol. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 305 | |
| 306 | To compile this code as a module, choose M here: the |
| 307 | module will be called cls_rsvp6. |
| 308 | |
| 309 | config NET_EMATCH |
| 310 | bool "Extended Matches" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 311 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 312 | ---help--- |
| 313 | Say Y here if you want to use extended matches on top of classifiers |
| 314 | and select the extended matches below. |
| 315 | |
| 316 | Extended matches are small classification helpers not worth writing |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 317 | a separate classifier for. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 318 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 319 | A recent version of the iproute2 package is required to use |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 320 | extended matches. |
| 321 | |
| 322 | config NET_EMATCH_STACK |
| 323 | int "Stack size" |
| 324 | depends on NET_EMATCH |
| 325 | default "32" |
| 326 | ---help--- |
| 327 | Size of the local stack variable used while evaluating the tree of |
| 328 | ematches. Limits the depth of the tree, i.e. the number of |
Thomas Graf | b824979 | 2005-06-08 15:10:22 -0700 | [diff] [blame] | 329 | encapsulated precedences. Every level requires 4 bytes of additional |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 330 | stack space. |
| 331 | |
| 332 | config NET_EMATCH_CMP |
| 333 | tristate "Simple packet data comparison" |
| 334 | depends on NET_EMATCH |
| 335 | ---help--- |
| 336 | Say Y here if you want to be able to classify packets based on |
| 337 | simple packet data comparisons for 8, 16, and 32bit values. |
| 338 | |
| 339 | To compile this code as a module, choose M here: the |
| 340 | module will be called em_cmp. |
| 341 | |
| 342 | config NET_EMATCH_NBYTE |
| 343 | tristate "Multi byte comparison" |
| 344 | depends on NET_EMATCH |
| 345 | ---help--- |
| 346 | Say Y here if you want to be able to classify packets based on |
| 347 | multiple byte comparisons mainly useful for IPv6 address comparisons. |
| 348 | |
| 349 | To compile this code as a module, choose M here: the |
| 350 | module will be called em_nbyte. |
| 351 | |
| 352 | config NET_EMATCH_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 353 | tristate "U32 key" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 354 | depends on NET_EMATCH |
| 355 | ---help--- |
| 356 | Say Y here if you want to be able to classify packets using |
| 357 | the famous u32 key in combination with logic relations. |
| 358 | |
| 359 | To compile this code as a module, choose M here: the |
| 360 | module will be called em_u32. |
| 361 | |
| 362 | config NET_EMATCH_META |
| 363 | tristate "Metadata" |
| 364 | depends on NET_EMATCH |
| 365 | ---help--- |
Adrian Bunk | bb7e8c5 | 2006-01-11 16:40:30 -0800 | [diff] [blame] | 366 | Say Y here if you want to be able to classify packets based on |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 367 | metadata such as load average, netfilter attributes, socket |
| 368 | attributes and routing decisions. |
| 369 | |
| 370 | To compile this code as a module, choose M here: the |
| 371 | module will be called em_meta. |
| 372 | |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 373 | config NET_EMATCH_TEXT |
| 374 | tristate "Textsearch" |
| 375 | depends on NET_EMATCH |
David S. Miller | f2d368f | 2005-06-23 23:55:41 -0700 | [diff] [blame] | 376 | select TEXTSEARCH |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 377 | select TEXTSEARCH_KMP |
David S. Miller | 29cb9f9 | 2005-08-25 16:23:11 -0700 | [diff] [blame] | 378 | select TEXTSEARCH_BM |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 379 | select TEXTSEARCH_FSM |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 380 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 381 | Say Y here if you want to be able to classify packets based on |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 382 | textsearch comparisons. |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 383 | |
| 384 | To compile this code as a module, choose M here: the |
| 385 | module will be called em_text. |
| 386 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 387 | config NET_CLS_ACT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 388 | bool "Actions" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 389 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 390 | Say Y here if you want to use traffic control actions. Actions |
| 391 | get attached to classifiers and are invoked after a successful |
| 392 | classification. They are used to overwrite the classification |
| 393 | result, instantly drop or redirect packets, etc. |
| 394 | |
| 395 | A recent version of the iproute2 package is required to use |
| 396 | extended matches. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 397 | |
| 398 | config NET_ACT_POLICE |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 399 | tristate "Traffic Policing" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 400 | depends on NET_CLS_ACT |
| 401 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 402 | Say Y here if you want to do traffic policing, i.e. strict |
| 403 | bandwidth limiting. This action replaces the existing policing |
| 404 | module. |
| 405 | |
| 406 | To compile this code as a module, choose M here: the |
| 407 | module will be called police. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 408 | |
| 409 | config NET_ACT_GACT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 410 | tristate "Generic actions" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 411 | depends on NET_CLS_ACT |
| 412 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 413 | Say Y here to take generic actions such as dropping and |
| 414 | accepting packets. |
| 415 | |
| 416 | To compile this code as a module, choose M here: the |
| 417 | module will be called gact. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 418 | |
| 419 | config GACT_PROB |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 420 | bool "Probability support" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 421 | depends on NET_ACT_GACT |
| 422 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 423 | Say Y here to use the generic action randomly or deterministically. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 424 | |
| 425 | config NET_ACT_MIRRED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 426 | tristate "Redirecting and Mirroring" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 427 | depends on NET_CLS_ACT |
| 428 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 429 | Say Y here to allow packets to be mirrored or redirected to |
| 430 | other devices. |
| 431 | |
| 432 | To compile this code as a module, choose M here: the |
| 433 | module will be called mirred. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 434 | |
| 435 | config NET_ACT_IPT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 436 | tristate "IPtables targets" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 437 | depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES |
| 438 | ---help--- |
Matt LaPlante | 3539c27 | 2006-06-30 18:53:46 +0200 | [diff] [blame] | 439 | Say Y here to be able to invoke iptables targets after successful |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 440 | classification. |
| 441 | |
| 442 | To compile this code as a module, choose M here: the |
| 443 | module will be called ipt. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 444 | |
Herbert Xu | b421995 | 2007-09-27 12:48:05 -0700 | [diff] [blame] | 445 | config NET_ACT_NAT |
| 446 | tristate "Stateless NAT" |
| 447 | depends on NET_CLS_ACT |
| 448 | select NETFILTER |
| 449 | ---help--- |
| 450 | Say Y here to do stateless NAT on IPv4 packets. You should use |
| 451 | netfilter for NAT unless you know what you are doing. |
| 452 | |
| 453 | To compile this code as a module, choose M here: the |
| 454 | module will be called nat. |
| 455 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 456 | config NET_ACT_PEDIT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 457 | tristate "Packet Editing" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 458 | depends on NET_CLS_ACT |
| 459 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 460 | Say Y here if you want to mangle the content of packets. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 461 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 462 | To compile this code as a module, choose M here: the |
| 463 | module will be called pedit. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 464 | |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 465 | config NET_ACT_SIMP |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 466 | tristate "Simple Example (Debug)" |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 467 | depends on NET_CLS_ACT |
| 468 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 469 | Say Y here to add a simple action for demonstration purposes. |
| 470 | It is meant as an example and for debugging purposes. It will |
| 471 | print a configured policy string followed by the packet count |
| 472 | to the console for every packet that passes by. |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 473 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 474 | If unsure, say N. |
| 475 | |
| 476 | To compile this code as a module, choose M here: the |
| 477 | module will be called simple. |
| 478 | |
| 479 | config NET_CLS_POLICE |
| 480 | bool "Traffic Policing (obsolete)" |
Patrick McHardy | c3bc7cf | 2007-07-15 00:03:05 -0700 | [diff] [blame] | 481 | select NET_CLS_ACT |
| 482 | select NET_ACT_POLICE |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 483 | ---help--- |
| 484 | Say Y here if you want to do traffic policing, i.e. strict |
Patrick McHardy | c3bc7cf | 2007-07-15 00:03:05 -0700 | [diff] [blame] | 485 | bandwidth limiting. This option is obsolete and just selects |
| 486 | the option replacing it. It will be removed in the future. |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 487 | |
| 488 | config NET_CLS_IND |
| 489 | bool "Incoming device classification" |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 490 | depends on NET_CLS_U32 || NET_CLS_FW |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 491 | ---help--- |
| 492 | Say Y here to extend the u32 and fw classifier to support |
| 493 | classification based on the incoming device. This option is |
| 494 | likely to disappear in favour of the metadata ematch. |
| 495 | |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 496 | endif # NET_SCHED |
| 497 | |
Randy Dunlap | 85ef3e5 | 2007-10-18 21:56:38 -0700 | [diff] [blame] | 498 | config NET_SCH_FIFO |
| 499 | bool |