Kconfig 16 KB

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