Kconfig 15 KB

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