Kconfig 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567
  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. ---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. choice
  36. prompt "Packet scheduler clock source"
  37. depends on NET_SCHED
  38. default NET_SCH_CLK_JIFFIES
  39. ---help---
  40. Packet schedulers need a monotonic clock that increments at a static
  41. rate. The kernel provides several suitable interfaces, each with
  42. different properties:
  43. - high resolution (us or better)
  44. - fast to read (minimal locking, no i/o access)
  45. - synchronized on all processors
  46. - handles cpu clock frequency changes
  47. but nothing provides all of the above.
  48. config NET_SCH_CLK_JIFFIES
  49. bool "Timer interrupt"
  50. ---help---
  51. Say Y here if you want to use the timer interrupt (jiffies) as clock
  52. source. This clock source is fast, synchronized on all processors and
  53. handles cpu clock frequency changes, but its resolution is too low
  54. for accurate shaping except at very low speed.
  55. config NET_SCH_CLK_GETTIMEOFDAY
  56. bool "gettimeofday"
  57. ---help---
  58. Say Y here if you want to use gettimeofday as clock source. This clock
  59. source has high resolution, is synchronized on all processors and
  60. handles cpu clock frequency changes, but it is slow.
  61. Choose this if you need a high resolution clock source but can't use
  62. the CPU's cycle counter.
  63. # don't allow on SMP x86 because they can have unsynchronized TSCs.
  64. # gettimeofday is a good alternative
  65. config NET_SCH_CLK_CPU
  66. bool "CPU cycle counter"
  67. depends on ((X86_TSC || X86_64) && !SMP) || ALPHA || SPARC64 || PPC64 || IA64
  68. ---help---
  69. Say Y here if you want to use the CPU's cycle counter as clock source.
  70. This is a cheap and high resolution clock source, but on some
  71. architectures it is not synchronized on all processors and doesn't
  72. handle cpu clock frequency changes.
  73. The useable cycle counters are:
  74. x86/x86_64 - Timestamp Counter
  75. alpha - Cycle Counter
  76. sparc64 - %ticks register
  77. ppc64 - Time base
  78. ia64 - Interval Time Counter
  79. Choose this if your CPU's cycle counter is working properly.
  80. endchoice
  81. comment "Queueing/Scheduling"
  82. depends on NET_SCHED
  83. config NET_SCH_CBQ
  84. tristate "Class Based Queueing (CBQ)"
  85. depends on NET_SCHED
  86. ---help---
  87. Say Y here if you want to use the Class-Based Queueing (CBQ) packet
  88. scheduling algorithm. This algorithm classifies the waiting packets
  89. into a tree-like hierarchy of classes; the leaves of this tree are
  90. in turn scheduled by separate algorithms.
  91. See the top of <file:net/sched/sch_cbq.c> for more details.
  92. CBQ is a commonly used scheduler, so if you're unsure, you should
  93. say Y here. Then say Y to all the queueing algorithms below that you
  94. want to use as leaf disciplines.
  95. To compile this code as a module, choose M here: the
  96. module will be called sch_cbq.
  97. config NET_SCH_HTB
  98. tristate "Hierarchical Token Bucket (HTB)"
  99. depends on NET_SCHED
  100. ---help---
  101. Say Y here if you want to use the Hierarchical Token Buckets (HTB)
  102. packet scheduling algorithm. See
  103. <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
  104. in-depth articles.
  105. HTB is very similar to CBQ regarding its goals however is has
  106. different properties and different algorithm.
  107. To compile this code as a module, choose M here: the
  108. module will be called sch_htb.
  109. config NET_SCH_HFSC
  110. tristate "Hierarchical Fair Service Curve (HFSC)"
  111. depends on NET_SCHED
  112. ---help---
  113. Say Y here if you want to use the Hierarchical Fair Service Curve
  114. (HFSC) packet scheduling algorithm.
  115. To compile this code as a module, choose M here: the
  116. module will be called sch_hfsc.
  117. config NET_SCH_ATM
  118. tristate "ATM Virtual Circuits (ATM)"
  119. depends on NET_SCHED && ATM
  120. ---help---
  121. Say Y here if you want to use the ATM pseudo-scheduler. This
  122. provides a framework for invoking classifiers, which in turn
  123. select classes of this queuing discipline. Each class maps
  124. the flow(s) it is handling to a given virtual circuit.
  125. See the top of <file:net/sched/sch_atm.c>) for more details.
  126. To compile this code as a module, choose M here: the
  127. module will be called sch_atm.
  128. config NET_SCH_PRIO
  129. tristate "Multi Band Priority Queueing (PRIO)"
  130. depends on NET_SCHED
  131. ---help---
  132. Say Y here if you want to use an n-band priority queue packet
  133. scheduler.
  134. To compile this code as a module, choose M here: the
  135. module will be called sch_prio.
  136. config NET_SCH_RED
  137. tristate "Random Early Detection (RED)"
  138. depends on NET_SCHED
  139. ---help---
  140. Say Y here if you want to use the Random Early Detection (RED)
  141. packet scheduling algorithm.
  142. See the top of <file:net/sched/sch_red.c> for more details.
  143. To compile this code as a module, choose M here: the
  144. module will be called sch_red.
  145. config NET_SCH_SFQ
  146. tristate "Stochastic Fairness Queueing (SFQ)"
  147. depends on NET_SCHED
  148. ---help---
  149. Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
  150. packet scheduling algorithm .
  151. See the top of <file:net/sched/sch_sfq.c> for more details.
  152. To compile this code as a module, choose M here: the
  153. module will be called sch_sfq.
  154. config NET_SCH_TEQL
  155. tristate "True Link Equalizer (TEQL)"
  156. depends on NET_SCHED
  157. ---help---
  158. Say Y here if you want to use the True Link Equalizer (TLE) packet
  159. scheduling algorithm. This queueing discipline allows the combination
  160. of several physical devices into one virtual device.
  161. See the top of <file:net/sched/sch_teql.c> for more details.
  162. To compile this code as a module, choose M here: the
  163. module will be called sch_teql.
  164. config NET_SCH_TBF
  165. tristate "Token Bucket Filter (TBF)"
  166. depends on NET_SCHED
  167. ---help---
  168. Say Y here if you want to use the Token Bucket Filter (TBF) packet
  169. scheduling algorithm.
  170. See the top of <file:net/sched/sch_tbf.c> for more details.
  171. To compile this code as a module, choose M here: the
  172. module will be called sch_tbf.
  173. config NET_SCH_GRED
  174. tristate "Generic Random Early Detection (GRED)"
  175. depends on NET_SCHED
  176. ---help---
  177. Say Y here if you want to use the Generic Random Early Detection
  178. (GRED) packet scheduling algorithm for some of your network devices
  179. (see the top of <file:net/sched/sch_red.c> for details and
  180. references about the algorithm).
  181. To compile this code as a module, choose M here: the
  182. module will be called sch_gred.
  183. config NET_SCH_DSMARK
  184. tristate "Differentiated Services marker (DSMARK)"
  185. depends on NET_SCHED
  186. ---help---
  187. Say Y if you want to schedule packets according to the
  188. Differentiated Services architecture proposed in RFC 2475.
  189. Technical information on this method, with pointers to associated
  190. RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
  191. To compile this code as a module, choose M here: the
  192. module will be called sch_dsmark.
  193. config NET_SCH_NETEM
  194. tristate "Network emulator (NETEM)"
  195. depends on NET_SCHED
  196. ---help---
  197. Say Y if you want to emulate network delay, loss, and packet
  198. re-ordering. This is often useful to simulate networks when
  199. testing applications or protocols.
  200. To compile this driver as a module, choose M here: the module
  201. will be called sch_netem.
  202. If unsure, say N.
  203. config NET_SCH_INGRESS
  204. tristate "Ingress Qdisc"
  205. depends on NET_SCHED
  206. ---help---
  207. Say Y here if you want to use classifiers for incoming packets.
  208. If unsure, say Y.
  209. To compile this code as a module, choose M here: the
  210. module will be called sch_ingress.
  211. comment "Classification"
  212. depends on NET_SCHED
  213. config NET_CLS
  214. boolean
  215. config NET_CLS_BASIC
  216. tristate "Elementary classification (BASIC)"
  217. depends NET_SCHED
  218. select NET_CLS
  219. ---help---
  220. Say Y here if you want to be able to classify packets using
  221. only extended matches and actions.
  222. To compile this code as a module, choose M here: the
  223. module will be called cls_basic.
  224. config NET_CLS_TCINDEX
  225. tristate "Traffic-Control Index (TCINDEX)"
  226. depends NET_SCHED
  227. select NET_CLS
  228. ---help---
  229. Say Y here if you want to be able to classify packets based on
  230. traffic control indices. You will want this feature if you want
  231. to implement Differentiated Services together with DSMARK.
  232. To compile this code as a module, choose M here: the
  233. module will be called cls_tcindex.
  234. config NET_CLS_ROUTE4
  235. tristate "Routing decision (ROUTE)"
  236. depends NET_SCHED
  237. select NET_CLS_ROUTE
  238. select NET_CLS
  239. ---help---
  240. If you say Y here, you will be able to classify packets
  241. according to the route table entry they matched.
  242. To compile this code as a module, choose M here: the
  243. module will be called cls_route.
  244. config NET_CLS_ROUTE
  245. bool
  246. default n
  247. config NET_CLS_FW
  248. tristate "Netfilter mark (FW)"
  249. depends NET_SCHED
  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.
  254. To compile this code as a module, choose M here: the
  255. module will be called cls_fw.
  256. config NET_CLS_U32
  257. tristate "Universal 32bit comparisons w/ hashing (U32)"
  258. depends NET_SCHED
  259. select NET_CLS
  260. ---help---
  261. Say Y here to be able to classify packetes using a universal
  262. 32bit pieces based comparison scheme.
  263. To compile this code as a module, choose M here: the
  264. module will be called cls_u32.
  265. config CLS_U32_PERF
  266. bool "Performance counters support"
  267. depends on NET_CLS_U32
  268. ---help---
  269. Say Y here to make u32 gather additional statistics useful for
  270. fine tuning u32 classifiers.
  271. config CLS_U32_MARK
  272. bool "Netfilter marks support"
  273. depends on NET_CLS_U32 && NETFILTER
  274. ---help---
  275. Say Y here to be able to use netfilter marks as u32 key.
  276. config NET_CLS_RSVP
  277. tristate "IPv4 Resource Reservation Protocol (RSVP)"
  278. depends on NET_SCHED
  279. select NET_CLS
  280. select NET_ESTIMATOR
  281. ---help---
  282. The Resource Reservation Protocol (RSVP) permits end systems to
  283. request a minimum and maximum data flow rate for a connection; this
  284. is important for real time data such as streaming sound or video.
  285. Say Y here if you want to be able to classify outgoing packets based
  286. on their RSVP requests.
  287. To compile this code as a module, choose M here: the
  288. module will be called cls_rsvp.
  289. config NET_CLS_RSVP6
  290. tristate "IPv6 Resource Reservation Protocol (RSVP6)"
  291. depends on NET_SCHED
  292. select NET_CLS
  293. select NET_ESTIMATOR
  294. ---help---
  295. The Resource Reservation Protocol (RSVP) permits end systems to
  296. request a minimum and maximum data flow rate for a connection; this
  297. is important for real time data such as streaming sound or video.
  298. Say Y here if you want to be able to classify outgoing packets based
  299. on their RSVP requests and you are using the IPv6.
  300. To compile this code as a module, choose M here: the
  301. module will be called cls_rsvp6.
  302. config NET_EMATCH
  303. bool "Extended Matches"
  304. depends NET_SCHED
  305. select NET_CLS
  306. ---help---
  307. Say Y here if you want to use extended matches on top of classifiers
  308. and select the extended matches below.
  309. Extended matches are small classification helpers not worth writing
  310. a separate classifier for.
  311. A recent version of the iproute2 package is required to use
  312. extended matches.
  313. config NET_EMATCH_STACK
  314. int "Stack size"
  315. depends on NET_EMATCH
  316. default "32"
  317. ---help---
  318. Size of the local stack variable used while evaluating the tree of
  319. ematches. Limits the depth of the tree, i.e. the number of
  320. encapsulated precedences. Every level requires 4 bytes of additional
  321. stack space.
  322. config NET_EMATCH_CMP
  323. tristate "Simple packet data comparison"
  324. depends on NET_EMATCH
  325. ---help---
  326. Say Y here if you want to be able to classify packets based on
  327. simple packet data comparisons for 8, 16, and 32bit values.
  328. To compile this code as a module, choose M here: the
  329. module will be called em_cmp.
  330. config NET_EMATCH_NBYTE
  331. tristate "Multi byte comparison"
  332. depends on NET_EMATCH
  333. ---help---
  334. Say Y here if you want to be able to classify packets based on
  335. multiple byte comparisons mainly useful for IPv6 address comparisons.
  336. To compile this code as a module, choose M here: the
  337. module will be called em_nbyte.
  338. config NET_EMATCH_U32
  339. tristate "U32 key"
  340. depends on NET_EMATCH
  341. ---help---
  342. Say Y here if you want to be able to classify packets using
  343. the famous u32 key in combination with logic relations.
  344. To compile this code as a module, choose M here: the
  345. module will be called em_u32.
  346. config NET_EMATCH_META
  347. tristate "Metadata"
  348. depends on NET_EMATCH
  349. ---help---
  350. Say Y here if you want to be ablt to classify packets based on
  351. metadata such as load average, netfilter attributes, socket
  352. attributes and routing decisions.
  353. To compile this code as a module, choose M here: the
  354. module will be called em_meta.
  355. config NET_EMATCH_TEXT
  356. tristate "Textsearch"
  357. depends on NET_EMATCH
  358. select TEXTSEARCH
  359. select TEXTSEARCH_KMP
  360. select TEXTSEARCH_BM
  361. select TEXTSEARCH_FSM
  362. ---help---
  363. Say Y here if you want to be able to classify packets based on
  364. textsearch comparisons.
  365. To compile this code as a module, choose M here: the
  366. module will be called em_text.
  367. config NET_CLS_ACT
  368. bool "Actions"
  369. depends on EXPERIMENTAL && NET_SCHED
  370. select NET_ESTIMATOR
  371. ---help---
  372. Say Y here if you want to use traffic control actions. Actions
  373. get attached to classifiers and are invoked after a successful
  374. classification. They are used to overwrite the classification
  375. result, instantly drop or redirect packets, etc.
  376. A recent version of the iproute2 package is required to use
  377. extended matches.
  378. config NET_ACT_POLICE
  379. tristate "Traffic Policing"
  380. depends on NET_CLS_ACT
  381. ---help---
  382. Say Y here if you want to do traffic policing, i.e. strict
  383. bandwidth limiting. This action replaces the existing policing
  384. module.
  385. To compile this code as a module, choose M here: the
  386. module will be called police.
  387. config NET_ACT_GACT
  388. tristate "Generic actions"
  389. depends on NET_CLS_ACT
  390. ---help---
  391. Say Y here to take generic actions such as dropping and
  392. accepting packets.
  393. To compile this code as a module, choose M here: the
  394. module will be called gact.
  395. config GACT_PROB
  396. bool "Probability support"
  397. depends on NET_ACT_GACT
  398. ---help---
  399. Say Y here to use the generic action randomly or deterministically.
  400. config NET_ACT_MIRRED
  401. tristate "Redirecting and Mirroring"
  402. depends on NET_CLS_ACT
  403. ---help---
  404. Say Y here to allow packets to be mirrored or redirected to
  405. other devices.
  406. To compile this code as a module, choose M here: the
  407. module will be called mirred.
  408. config NET_ACT_IPT
  409. tristate "IPtables targets"
  410. depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
  411. ---help---
  412. Say Y here to be able to invoke iptables targets after succesful
  413. classification.
  414. To compile this code as a module, choose M here: the
  415. module will be called ipt.
  416. config NET_ACT_PEDIT
  417. tristate "Packet Editing"
  418. depends on NET_CLS_ACT
  419. ---help---
  420. Say Y here if you want to mangle the content of packets.
  421. To compile this code as a module, choose M here: the
  422. module will be called pedit.
  423. config NET_ACT_SIMP
  424. tristate "Simple Example (Debug)"
  425. depends on NET_CLS_ACT
  426. ---help---
  427. Say Y here to add a simple action for demonstration purposes.
  428. It is meant as an example and for debugging purposes. It will
  429. print a configured policy string followed by the packet count
  430. to the console for every packet that passes by.
  431. If unsure, say N.
  432. To compile this code as a module, choose M here: the
  433. module will be called simple.
  434. config NET_CLS_POLICE
  435. bool "Traffic Policing (obsolete)"
  436. depends on NET_SCHED && NET_CLS_ACT!=y
  437. select NET_ESTIMATOR
  438. ---help---
  439. Say Y here if you want to do traffic policing, i.e. strict
  440. bandwidth limiting. This option is obsoleted by the traffic
  441. policer implemented as action, it stays here for compatibility
  442. reasons.
  443. config NET_CLS_IND
  444. bool "Incoming device classification"
  445. depends on NET_SCHED && (NET_CLS_U32 || NET_CLS_FW)
  446. ---help---
  447. Say Y here to extend the u32 and fw classifier to support
  448. classification based on the incoming device. This option is
  449. likely to disappear in favour of the metadata ematch.
  450. config NET_ESTIMATOR
  451. bool "Rate estimator"
  452. depends on NET_SCHED
  453. ---help---
  454. Say Y here to allow using rate estimators to estimate the current
  455. rate-of-flow for network devices, queues, etc. This module is
  456. automaticaly selected if needed but can be selected manually for
  457. statstical purposes.
  458. endmenu