Kconfig 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510
  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_MULTIQ
  87. tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
  88. ---help---
  89. Say Y here if you want to use an n-band queue packet scheduler
  90. to support devices that have multiple hardware transmit queues.
  91. To compile this code as a module, choose M here: the
  92. module will be called sch_multiq.
  93. config NET_SCH_RED
  94. tristate "Random Early Detection (RED)"
  95. ---help---
  96. Say Y here if you want to use the Random Early Detection (RED)
  97. packet scheduling algorithm.
  98. See the top of <file:net/sched/sch_red.c> for more details.
  99. To compile this code as a module, choose M here: the
  100. module will be called sch_red.
  101. config NET_SCH_SFQ
  102. tristate "Stochastic Fairness Queueing (SFQ)"
  103. ---help---
  104. Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
  105. packet scheduling algorithm.
  106. See the top of <file:net/sched/sch_sfq.c> for more details.
  107. To compile this code as a module, choose M here: the
  108. module will be called sch_sfq.
  109. config NET_SCH_TEQL
  110. tristate "True Link Equalizer (TEQL)"
  111. ---help---
  112. Say Y here if you want to use the True Link Equalizer (TLE) packet
  113. scheduling algorithm. This queueing discipline allows the combination
  114. of several physical devices into one virtual device.
  115. See the top of <file:net/sched/sch_teql.c> for more details.
  116. To compile this code as a module, choose M here: the
  117. module will be called sch_teql.
  118. config NET_SCH_TBF
  119. tristate "Token Bucket Filter (TBF)"
  120. ---help---
  121. Say Y here if you want to use the Token Bucket Filter (TBF) packet
  122. scheduling algorithm.
  123. See the top of <file:net/sched/sch_tbf.c> for more details.
  124. To compile this code as a module, choose M here: the
  125. module will be called sch_tbf.
  126. config NET_SCH_GRED
  127. tristate "Generic Random Early Detection (GRED)"
  128. ---help---
  129. Say Y here if you want to use the Generic Random Early Detection
  130. (GRED) packet scheduling algorithm for some of your network devices
  131. (see the top of <file:net/sched/sch_red.c> for details and
  132. references about the algorithm).
  133. To compile this code as a module, choose M here: the
  134. module will be called sch_gred.
  135. config NET_SCH_DSMARK
  136. tristate "Differentiated Services marker (DSMARK)"
  137. ---help---
  138. Say Y if you want to schedule packets according to the
  139. Differentiated Services architecture proposed in RFC 2475.
  140. Technical information on this method, with pointers to associated
  141. RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
  142. To compile this code as a module, choose M here: the
  143. module will be called sch_dsmark.
  144. config NET_SCH_NETEM
  145. tristate "Network emulator (NETEM)"
  146. ---help---
  147. Say Y if you want to emulate network delay, loss, and packet
  148. re-ordering. This is often useful to simulate networks when
  149. testing applications or protocols.
  150. To compile this driver as a module, choose M here: the module
  151. will be called sch_netem.
  152. If unsure, say N.
  153. config NET_SCH_INGRESS
  154. tristate "Ingress Qdisc"
  155. depends on NET_CLS_ACT
  156. ---help---
  157. Say Y here if you want to use classifiers for incoming packets.
  158. If unsure, say Y.
  159. To compile this code as a module, choose M here: the
  160. module will be called sch_ingress.
  161. comment "Classification"
  162. config NET_CLS
  163. boolean
  164. config NET_CLS_BASIC
  165. tristate "Elementary classification (BASIC)"
  166. select NET_CLS
  167. ---help---
  168. Say Y here if you want to be able to classify packets using
  169. only extended matches and actions.
  170. To compile this code as a module, choose M here: the
  171. module will be called cls_basic.
  172. config NET_CLS_TCINDEX
  173. tristate "Traffic-Control Index (TCINDEX)"
  174. select NET_CLS
  175. ---help---
  176. Say Y here if you want to be able to classify packets based on
  177. traffic control indices. You will want this feature if you want
  178. to implement Differentiated Services together with DSMARK.
  179. To compile this code as a module, choose M here: the
  180. module will be called cls_tcindex.
  181. config NET_CLS_ROUTE4
  182. tristate "Routing decision (ROUTE)"
  183. select NET_CLS_ROUTE
  184. select NET_CLS
  185. ---help---
  186. If you say Y here, you will be able to classify packets
  187. according to the route table entry they matched.
  188. To compile this code as a module, choose M here: the
  189. module will be called cls_route.
  190. config NET_CLS_ROUTE
  191. bool
  192. config NET_CLS_FW
  193. tristate "Netfilter mark (FW)"
  194. select NET_CLS
  195. ---help---
  196. If you say Y here, you will be able to classify packets
  197. according to netfilter/firewall marks.
  198. To compile this code as a module, choose M here: the
  199. module will be called cls_fw.
  200. config NET_CLS_U32
  201. tristate "Universal 32bit comparisons w/ hashing (U32)"
  202. select NET_CLS
  203. ---help---
  204. Say Y here to be able to classify packets using a universal
  205. 32bit pieces based comparison scheme.
  206. To compile this code as a module, choose M here: the
  207. module will be called cls_u32.
  208. config CLS_U32_PERF
  209. bool "Performance counters support"
  210. depends on NET_CLS_U32
  211. ---help---
  212. Say Y here to make u32 gather additional statistics useful for
  213. fine tuning u32 classifiers.
  214. config CLS_U32_MARK
  215. bool "Netfilter marks support"
  216. depends on NET_CLS_U32
  217. ---help---
  218. Say Y here to be able to use netfilter marks as u32 key.
  219. config NET_CLS_RSVP
  220. tristate "IPv4 Resource Reservation Protocol (RSVP)"
  221. select NET_CLS
  222. ---help---
  223. The Resource Reservation Protocol (RSVP) permits end systems to
  224. request a minimum and maximum data flow rate for a connection; this
  225. is important for real time data such as streaming sound or video.
  226. Say Y here if you want to be able to classify outgoing packets based
  227. on their RSVP requests.
  228. To compile this code as a module, choose M here: the
  229. module will be called cls_rsvp.
  230. config NET_CLS_RSVP6
  231. tristate "IPv6 Resource Reservation Protocol (RSVP6)"
  232. select NET_CLS
  233. ---help---
  234. The Resource Reservation Protocol (RSVP) permits end systems to
  235. request a minimum and maximum data flow rate for a connection; this
  236. is important for real time data such as streaming sound or video.
  237. Say Y here if you want to be able to classify outgoing packets based
  238. on their RSVP requests and you are using the IPv6 protocol.
  239. To compile this code as a module, choose M here: the
  240. module will be called cls_rsvp6.
  241. config NET_CLS_FLOW
  242. tristate "Flow classifier"
  243. select NET_CLS
  244. ---help---
  245. If you say Y here, you will be able to classify packets based on
  246. a configurable combination of packet keys. This is mostly useful
  247. in combination with SFQ.
  248. To compile this code as a module, choose M here: the
  249. module will be called cls_flow.
  250. config NET_EMATCH
  251. bool "Extended Matches"
  252. select NET_CLS
  253. ---help---
  254. Say Y here if you want to use extended matches on top of classifiers
  255. and select the extended matches below.
  256. Extended matches are small classification helpers not worth writing
  257. a separate classifier for.
  258. A recent version of the iproute2 package is required to use
  259. extended matches.
  260. config NET_EMATCH_STACK
  261. int "Stack size"
  262. depends on NET_EMATCH
  263. default "32"
  264. ---help---
  265. Size of the local stack variable used while evaluating the tree of
  266. ematches. Limits the depth of the tree, i.e. the number of
  267. encapsulated precedences. Every level requires 4 bytes of additional
  268. stack space.
  269. config NET_EMATCH_CMP
  270. tristate "Simple packet data comparison"
  271. depends on NET_EMATCH
  272. ---help---
  273. Say Y here if you want to be able to classify packets based on
  274. simple packet data comparisons for 8, 16, and 32bit values.
  275. To compile this code as a module, choose M here: the
  276. module will be called em_cmp.
  277. config NET_EMATCH_NBYTE
  278. tristate "Multi byte comparison"
  279. depends on NET_EMATCH
  280. ---help---
  281. Say Y here if you want to be able to classify packets based on
  282. multiple byte comparisons mainly useful for IPv6 address comparisons.
  283. To compile this code as a module, choose M here: the
  284. module will be called em_nbyte.
  285. config NET_EMATCH_U32
  286. tristate "U32 key"
  287. depends on NET_EMATCH
  288. ---help---
  289. Say Y here if you want to be able to classify packets using
  290. the famous u32 key in combination with logic relations.
  291. To compile this code as a module, choose M here: the
  292. module will be called em_u32.
  293. config NET_EMATCH_META
  294. tristate "Metadata"
  295. depends on NET_EMATCH
  296. ---help---
  297. Say Y here if you want to be able to classify packets based on
  298. metadata such as load average, netfilter attributes, socket
  299. attributes and routing decisions.
  300. To compile this code as a module, choose M here: the
  301. module will be called em_meta.
  302. config NET_EMATCH_TEXT
  303. tristate "Textsearch"
  304. depends on NET_EMATCH
  305. select TEXTSEARCH
  306. select TEXTSEARCH_KMP
  307. select TEXTSEARCH_BM
  308. select TEXTSEARCH_FSM
  309. ---help---
  310. Say Y here if you want to be able to classify packets based on
  311. textsearch comparisons.
  312. To compile this code as a module, choose M here: the
  313. module will be called em_text.
  314. config NET_CLS_ACT
  315. bool "Actions"
  316. ---help---
  317. Say Y here if you want to use traffic control actions. Actions
  318. get attached to classifiers and are invoked after a successful
  319. classification. They are used to overwrite the classification
  320. result, instantly drop or redirect packets, etc.
  321. A recent version of the iproute2 package is required to use
  322. extended matches.
  323. config NET_ACT_POLICE
  324. tristate "Traffic Policing"
  325. depends on NET_CLS_ACT
  326. ---help---
  327. Say Y here if you want to do traffic policing, i.e. strict
  328. bandwidth limiting. This action replaces the existing policing
  329. module.
  330. To compile this code as a module, choose M here: the
  331. module will be called police.
  332. config NET_ACT_GACT
  333. tristate "Generic actions"
  334. depends on NET_CLS_ACT
  335. ---help---
  336. Say Y here to take generic actions such as dropping and
  337. accepting packets.
  338. To compile this code as a module, choose M here: the
  339. module will be called gact.
  340. config GACT_PROB
  341. bool "Probability support"
  342. depends on NET_ACT_GACT
  343. ---help---
  344. Say Y here to use the generic action randomly or deterministically.
  345. config NET_ACT_MIRRED
  346. tristate "Redirecting and Mirroring"
  347. depends on NET_CLS_ACT
  348. ---help---
  349. Say Y here to allow packets to be mirrored or redirected to
  350. other devices.
  351. To compile this code as a module, choose M here: the
  352. module will be called mirred.
  353. config NET_ACT_IPT
  354. tristate "IPtables targets"
  355. depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
  356. ---help---
  357. Say Y here to be able to invoke iptables targets after successful
  358. classification.
  359. To compile this code as a module, choose M here: the
  360. module will be called ipt.
  361. config NET_ACT_NAT
  362. tristate "Stateless NAT"
  363. depends on NET_CLS_ACT
  364. ---help---
  365. Say Y here to do stateless NAT on IPv4 packets. You should use
  366. netfilter for NAT unless you know what you are doing.
  367. To compile this code as a module, choose M here: the
  368. module will be called nat.
  369. config NET_ACT_PEDIT
  370. tristate "Packet Editing"
  371. depends on NET_CLS_ACT
  372. ---help---
  373. Say Y here if you want to mangle the content of packets.
  374. To compile this code as a module, choose M here: the
  375. module will be called pedit.
  376. config NET_ACT_SIMP
  377. tristate "Simple Example (Debug)"
  378. depends on NET_CLS_ACT
  379. ---help---
  380. Say Y here to add a simple action for demonstration purposes.
  381. It is meant as an example and for debugging purposes. It will
  382. print a configured policy string followed by the packet count
  383. to the console for every packet that passes by.
  384. If unsure, say N.
  385. To compile this code as a module, choose M here: the
  386. module will be called simple.
  387. config NET_ACT_SKBEDIT
  388. tristate "SKB Editing"
  389. depends on NET_CLS_ACT
  390. ---help---
  391. Say Y here to change skb priority or queue_mapping settings.
  392. If unsure, say N.
  393. To compile this code as a module, choose M here: the
  394. module will be called skbedit.
  395. config NET_CLS_IND
  396. bool "Incoming device classification"
  397. depends on NET_CLS_U32 || NET_CLS_FW
  398. ---help---
  399. Say Y here to extend the u32 and fw classifier to support
  400. classification based on the incoming device. This option is
  401. likely to disappear in favour of the metadata ematch.
  402. endif # NET_SCHED
  403. config NET_SCH_FIFO
  404. bool