1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
# This file is part of the OpenADK project. OpenADK is copyrighted
# material, please see the LICENCE file in the top-level directory.
menu "QoS and/or fair queueing"
config ADK_WALDUX_KERNEL_NET_SCH_CSZ
bool
config ADK_WALDUX_KERNEL_NET_SCH_NETEM
bool
config ADK_WALDUX_KERNEL_NET_QOS
bool
config ADK_WALDUX_KERNEL_NET_ESTIMATOR
bool
config ADK_WALDUX_KERNEL_NET_SCHED
bool
help
When the kernel has several packets to send out over a network
device, it has to decide which ones to send first, which ones to
delay, and which ones to drop. This is the job of the queueing
disciplines, several different algorithms for how to do this
"fairly" have been proposed.
If you say N here, you will get the standard packet scheduler, which
is a FIFO (first come, first served). If you say Y here, you will be
able to choose from among several alternative algorithms which can
then be attached to different network devices. This is useful for
example if some of your network devices are real time devices that
need a certain minimum data flow rate, or if you need to limit the
maximum data flow rate for traffic which matches specified criteria.
This code is considered to be experimental.
To administer these schedulers, you'll need the user-level utilities
from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
That package also contains some documentation; for more, check out
<http://linux-net.osdl.org/index.php/Iproute2>.
This Quality of Service (QoS) support will enable you to use
Differentiated Services (diffserv) and Resource Reservation Protocol
(RSVP) on your Linux router if you also say Y to the corresponding
classifiers below. Documentation and software is at
<http://diffserv.sourceforge.net/>.
comment "Queueing/Scheduling"
config ADK_WALDUX_KERNEL_NET_SCH_CBQ
tristate "Class Based Queueing (CBQ)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Class-Based Queueing (CBQ) packet
scheduling algorithm. This algorithm classifies the waiting packets
into a tree-like hierarchy of classes; the leaves of this tree are
in turn scheduled by separate algorithms.
See the top of <file:net/sched/sch_cbq.c> for more details.
CBQ is a commonly used scheduler, so if you're unsure, you should
say Y here. Then say Y to all the queueing algorithms below that you
want to use as leaf disciplines.
config ADK_WALDUX_KERNEL_NET_SCH_HTB
tristate "Hierarchical Token Bucket (HTB)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Hierarchical Token Buckets (HTB)
packet scheduling algorithm. See
<http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
in-depth articles.
HTB is very similar to CBQ regarding its goals however is has
different properties and different algorithm.
config ADK_WALDUX_KERNEL_NET_SCH_HFSC
tristate "Hierarchical Fair Service Curve (HFSC)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Hierarchical Fair Service Curve
(HFSC) packet scheduling algorithm.
config ADK_WALDUX_KERNEL_NET_SCH_ATM
tristate "ATM Virtual Circuits (ATM)"
depends on ADK_WALDUX_KERNEL_ATM
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the ATM pseudo-scheduler. This
provides a framework for invoking classifiers, which in turn
select classes of this queuing discipline. Each class maps
the flow(s) it is handling to a given virtual circuit.
See the top of <file:net/sched/sch_atm.c>) for more details.
config ADK_WALDUX_KERNEL_NET_SCH_PRIO
tristate "Multi Band Priority Queueing (PRIO)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use an n-band priority queue packet
scheduler.
config ADK_WALDUX_KERNEL_NET_SCH_RED
tristate "Random Early Detection (RED)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Random Early Detection (RED)
packet scheduling algorithm.
See the top of <file:net/sched/sch_red.c> for more details.
config ADK_WALDUX_KERNEL_NET_SCH_SFQ
tristate "Stochastic Fairness Queueing (SFQ)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
packet scheduling algorithm .
See the top of <file:net/sched/sch_sfq.c> for more details.
config ADK_WALDUX_KERNEL_NET_SCH_TBF
tristate "Token Bucket Filter (TBF)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Token Bucket Filter (TBF) packet
scheduling algorithm.
See the top of <file:net/sched/sch_tbf.c> for more details.
config ADK_WALDUX_KERNEL_NET_SCH_GRED
tristate "Generic Random Early Detection (GRED)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y here if you want to use the Generic Random Early Detection
(GRED) packet scheduling algorithm for some of your network devices
(see the top of <file:net/sched/sch_red.c> for details and
references about the algorithm).
config ADK_WALDUX_KERNEL_NET_SCH_DSMARK
tristate "Differentiated Services marker (DSMARK)"
select ADK_WALDUX_KERNEL_NET_SCHED
default n
help
Say Y if you want to schedule packets according to the
Differentiated Services architecture proposed in RFC 2475.
Technical information on this method, with pointers to associated
RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
config ADK_WALDUX_KERNEL_NET_SCH_INGRESS
tristate "Ingress Qdisc"
select ADK_WALDUX_KERNEL_NET_SCHED
select ADK_WALDUX_KERNEL_NETFILTER
select ADK_WALDUX_KERNEL_NET_CLS_ACT
default n
help
Say Y here if you want to use classifiers for incoming packets.
If unsure, say Y.
comment "Classification"
config ADK_WALDUX_KERNEL_NET_CLS
bool
select ADK_WALDUX_KERNEL_NET_SCHED
default n
config ADK_WALDUX_KERNEL_NET_CLS_BASIC
tristate "Elementary classification (BASIC)"
select ADK_WALDUX_KERNEL_NET_CLS
default n
help
Say Y here if you want to be able to classify packets using
only extended matches and actions.
config ADK_WALDUX_KERNEL_NET_CLS_TCINDEX
tristate "Traffic-Control Index (TCINDEX)"
select ADK_WALDUX_KERNEL_NET_CLS
default n
help
Say Y here if you want to be able to classify packets based on
traffic control indices. You will want this feature if you want
to implement Differentiated Services together with DSMARK.
config ADK_WALDUX_KERNEL_NET_CLS_ROUTE4
tristate "Routing decision (ROUTE)"
select ADK_WALDUX_KERNEL_NET_CLS
default n
help
If you say Y here, you will be able to classify packets
according to the route table entry they matched.
config ADK_WALDUX_KERNEL_NET_CLS_FW
tristate "Netfilter mark (FW)"
select ADK_WALDUX_KERNEL_NET_CLS
default n
help
If you say Y here, you will be able to classify packets
according to netfilter/firewall marks.
config ADK_WALDUX_KERNEL_NET_CLS_U32
tristate "Universal 32bit comparisons w/ hashing (U32)"
select ADK_WALDUX_KERNEL_NET_CLS
default n
help
Say Y here to be able to classify packets using a universal
32bit pieces based comparison scheme.
config ADK_WALDUX_KERNEL_NET_CLS_U32_PERF
bool "Performance counters support"
select ADK_WALDUX_KERNEL_NET_CLS
depends on ADK_WALDUX_KERNEL_NET_CLS_U32
default n
help
Say Y here to make u32 gather additional statistics useful for
fine tuning u32 classifiers.
config ADK_WALDUX_KERNEL_NET_CLS_U32_MARK
bool "Netfilter marks support"
select ADK_WALDUX_KERNEL_NET_CLS
depends on ADK_WALDUX_KERNEL_NET_CLS_U32
depends on ADK_WALDUX_KERNEL_NET_CLS_FW
default n
help
Say Y here to be able to use netfilter marks as u32 key.
comment "Actions"
config ADK_WALDUX_KERNEL_NET_CLS_ACT
bool
select ADK_WALDUX_KERNEL_NET_SCHED
select ADK_WALDUX_KERNEL_NET_ESTIMATOR
default n
config ADK_WALDUX_KERNEL_NET_ACT_POLICE
tristate "Traffic Policing"
select ADK_WALDUX_KERNEL_NET_CLS_ACT
default n
help
Say Y here if you want to do traffic policing, i.e. strict
bandwidth limiting. This action replaces the existing policing
module.
config ADK_WALDUX_KERNEL_NET_ACT_GACT
tristate "Generic actions"
select ADK_WALDUX_KERNEL_NET_CLS_ACT
default n
help
Say Y here to take generic actions such as dropping and
accepting packets.
config ADK_WALDUX_KERNEL_NET_ACT_MIRRED
tristate "Redirecting and Mirroring"
select ADK_WALDUX_KERNEL_NET_CLS_ACT
default n
help
Say Y here to allow packets to be mirrored or redirected to
other devices.
config ADK_WALDUX_KERNEL_NET_ACT_IPT
tristate "IPtables targets"
select ADK_WALDUX_KERNEL_NET_CLS_ACT
select ADK_WALDUX_KERNEL_IP_NF_IPTABLES
default n
help
Say Y here to be able to invoke iptables targets after successful
classification.
config ADK_WALDUX_KERNEL_NET_ACT_PEDIT
tristate "Packet Editing"
select ADK_WALDUX_KERNEL_NET_CLS_ACT
default n
help
Say Y here if you want to mangle the content of packets.
endmenu
|
