Kconfig 15 KB

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