Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | # |
2 | # IP Virtual Server configuration | |
3 | # | |
a6938a1e | 4 | menuconfig IP_VS |
f901b644 | 5 | tristate "IP virtual server support" |
f4bc17cd | 6 | depends on NET && INET && NETFILTER |
dba4490d | 7 | depends on (NF_CONNTRACK || NF_CONNTRACK=n) |
1da177e4 LT |
8 | ---help--- |
9 | IP Virtual Server support will let you build a high-performance | |
10 | virtual server based on cluster of two or more real servers. This | |
11 | option must be enabled for at least one of the clustered computers | |
12 | that will take care of intercepting incoming connections to a | |
13 | single IP address and scheduling them to real servers. | |
14 | ||
15 | Three request dispatching techniques are implemented, they are | |
16 | virtual server via NAT, virtual server via tunneling and virtual | |
17 | server via direct routing. The several scheduling algorithms can | |
18 | be used to choose which server the connection is directed to, | |
19 | thus load balancing can be achieved among the servers. For more | |
20 | information and its administration program, please visit the | |
21 | following URL: <http://www.linuxvirtualserver.org/>. | |
22 | ||
23 | If you want to compile it in kernel, say Y. To compile it as a | |
24 | module, choose M here. If unsure, say N. | |
25 | ||
a6938a1e JE |
26 | if IP_VS |
27 | ||
fab0de02 | 28 | config IP_VS_IPV6 |
0537ae6a | 29 | bool "IPv6 support for IPVS" |
2890a157 | 30 | depends on IPV6 = y || IP_VS = IPV6 |
63dca2c0 | 31 | select IP6_NF_IPTABLES |
fab0de02 | 32 | ---help--- |
2f74713d | 33 | Add IPv6 support to IPVS. |
fab0de02 | 34 | |
2f74713d | 35 | Say Y if unsure. |
fab0de02 | 36 | |
1da177e4 LT |
37 | config IP_VS_DEBUG |
38 | bool "IP virtual server debugging" | |
1da177e4 LT |
39 | ---help--- |
40 | Say Y here if you want to get additional messages useful in | |
41 | debugging the IP virtual server code. You can change the debug | |
42 | level in /proc/sys/net/ipv4/vs/debug_level | |
43 | ||
44 | config IP_VS_TAB_BITS | |
45 | int "IPVS connection table size (the Nth power of 2)" | |
2206a3f5 SW |
46 | range 8 20 |
47 | default 12 | |
1da177e4 LT |
48 | ---help--- |
49 | The IPVS connection hash table uses the chaining scheme to handle | |
50 | hash collisions. Using a big IPVS connection hash table will greatly | |
51 | reduce conflicts when there are hundreds of thousands of connections | |
52 | in the hash table. | |
53 | ||
54 | Note the table size must be power of 2. The table size will be the | |
55 | value of 2 to the your input number power. The number to choose is | |
56 | from 8 to 20, the default number is 12, which means the table size | |
57 | is 4096. Don't input the number too small, otherwise you will lose | |
58 | performance on it. You can adapt the table size yourself, according | |
59 | to your virtual server application. It is good to set the table size | |
60 | not far less than the number of connections per second multiplying | |
61 | average lasting time of connection in the table. For example, your | |
62 | virtual server gets 200 connections per second, the connection lasts | |
63 | for 200 seconds in average in the connection table, the table size | |
64 | should be not far less than 200x200, it is good to set the table | |
65 | size 32768 (2**15). | |
66 | ||
67 | Another note that each connection occupies 128 bytes effectively and | |
68 | each hash entry uses 8 bytes, so you can estimate how much memory is | |
69 | needed for your box. | |
70 | ||
6f7edb48 CB |
71 | You can overwrite this number setting conn_tab_bits module parameter |
72 | or by appending ip_vs.conn_tab_bits=? to the kernel command line | |
73 | if IP VS was compiled built-in. | |
74 | ||
1da177e4 | 75 | comment "IPVS transport protocol load balancing support" |
1da177e4 LT |
76 | |
77 | config IP_VS_PROTO_TCP | |
78 | bool "TCP load balancing support" | |
1da177e4 LT |
79 | ---help--- |
80 | This option enables support for load balancing TCP transport | |
81 | protocol. Say Y if unsure. | |
82 | ||
83 | config IP_VS_PROTO_UDP | |
84 | bool "UDP load balancing support" | |
1da177e4 LT |
85 | ---help--- |
86 | This option enables support for load balancing UDP transport | |
87 | protocol. Say Y if unsure. | |
88 | ||
409a1966 | 89 | config IP_VS_PROTO_AH_ESP |
72c7664f | 90 | def_bool IP_VS_PROTO_ESP || IP_VS_PROTO_AH |
409a1966 | 91 | |
1da177e4 LT |
92 | config IP_VS_PROTO_ESP |
93 | bool "ESP load balancing support" | |
1da177e4 | 94 | ---help--- |
44c09201 | 95 | This option enables support for load balancing ESP (Encapsulation |
1da177e4 LT |
96 | Security Payload) transport protocol. Say Y if unsure. |
97 | ||
98 | config IP_VS_PROTO_AH | |
99 | bool "AH load balancing support" | |
1da177e4 LT |
100 | ---help--- |
101 | This option enables support for load balancing AH (Authentication | |
102 | Header) transport protocol. Say Y if unsure. | |
103 | ||
2906f66a VMR |
104 | config IP_VS_PROTO_SCTP |
105 | bool "SCTP load balancing support" | |
106 | select LIBCRC32C | |
107 | ---help--- | |
108 | This option enables support for load balancing SCTP transport | |
109 | protocol. Say Y if unsure. | |
110 | ||
1da177e4 | 111 | comment "IPVS scheduler" |
1da177e4 LT |
112 | |
113 | config IP_VS_RR | |
114 | tristate "round-robin scheduling" | |
1da177e4 LT |
115 | ---help--- |
116 | The robin-robin scheduling algorithm simply directs network | |
117 | connections to different real servers in a round-robin manner. | |
118 | ||
119 | If you want to compile it in kernel, say Y. To compile it as a | |
120 | module, choose M here. If unsure, say N. | |
121 | ||
122 | config IP_VS_WRR | |
ae24e578 | 123 | tristate "weighted round-robin scheduling" |
1da177e4 LT |
124 | ---help--- |
125 | The weighted robin-robin scheduling algorithm directs network | |
126 | connections to different real servers based on server weights | |
127 | in a round-robin manner. Servers with higher weights receive | |
128 | new connections first than those with less weights, and servers | |
129 | with higher weights get more connections than those with less | |
130 | weights and servers with equal weights get equal connections. | |
131 | ||
132 | If you want to compile it in kernel, say Y. To compile it as a | |
133 | module, choose M here. If unsure, say N. | |
134 | ||
135 | config IP_VS_LC | |
136 | tristate "least-connection scheduling" | |
1da177e4 LT |
137 | ---help--- |
138 | The least-connection scheduling algorithm directs network | |
139 | connections to the server with the least number of active | |
140 | connections. | |
141 | ||
142 | If you want to compile it in kernel, say Y. To compile it as a | |
143 | module, choose M here. If unsure, say N. | |
144 | ||
145 | config IP_VS_WLC | |
146 | tristate "weighted least-connection scheduling" | |
1da177e4 LT |
147 | ---help--- |
148 | The weighted least-connection scheduling algorithm directs network | |
149 | connections to the server with the least active connections | |
150 | normalized by the server weight. | |
151 | ||
152 | If you want to compile it in kernel, say Y. To compile it as a | |
153 | module, choose M here. If unsure, say N. | |
616a9be2 KM |
154 | |
155 | config IP_VS_FO | |
156 | tristate "weighted failover scheduling" | |
157 | ---help--- | |
158 | The weighted failover scheduling algorithm directs network | |
159 | connections to the server with the highest weight that is | |
160 | currently available. | |
161 | ||
162 | If you want to compile it in kernel, say Y. To compile it as a | |
163 | module, choose M here. If unsure, say N. | |
1da177e4 LT |
164 | |
165 | config IP_VS_LBLC | |
166 | tristate "locality-based least-connection scheduling" | |
1da177e4 LT |
167 | ---help--- |
168 | The locality-based least-connection scheduling algorithm is for | |
169 | destination IP load balancing. It is usually used in cache cluster. | |
170 | This algorithm usually directs packet destined for an IP address to | |
171 | its server if the server is alive and under load. If the server is | |
172 | overloaded (its active connection numbers is larger than its weight) | |
173 | and there is a server in its half load, then allocate the weighted | |
174 | least-connection server to this IP address. | |
175 | ||
176 | If you want to compile it in kernel, say Y. To compile it as a | |
177 | module, choose M here. If unsure, say N. | |
178 | ||
179 | config IP_VS_LBLCR | |
180 | tristate "locality-based least-connection with replication scheduling" | |
1da177e4 LT |
181 | ---help--- |
182 | The locality-based least-connection with replication scheduling | |
183 | algorithm is also for destination IP load balancing. It is | |
184 | usually used in cache cluster. It differs from the LBLC scheduling | |
185 | as follows: the load balancer maintains mappings from a target | |
186 | to a set of server nodes that can serve the target. Requests for | |
187 | a target are assigned to the least-connection node in the target's | |
188 | server set. If all the node in the server set are over loaded, | |
189 | it picks up a least-connection node in the cluster and adds it | |
190 | in the sever set for the target. If the server set has not been | |
191 | modified for the specified time, the most loaded node is removed | |
192 | from the server set, in order to avoid high degree of replication. | |
193 | ||
194 | If you want to compile it in kernel, say Y. To compile it as a | |
195 | module, choose M here. If unsure, say N. | |
196 | ||
197 | config IP_VS_DH | |
198 | tristate "destination hashing scheduling" | |
1da177e4 LT |
199 | ---help--- |
200 | The destination hashing scheduling algorithm assigns network | |
201 | connections to the servers through looking up a statically assigned | |
202 | hash table by their destination IP addresses. | |
203 | ||
204 | If you want to compile it in kernel, say Y. To compile it as a | |
205 | module, choose M here. If unsure, say N. | |
206 | ||
207 | config IP_VS_SH | |
208 | tristate "source hashing scheduling" | |
1da177e4 LT |
209 | ---help--- |
210 | The source hashing scheduling algorithm assigns network | |
211 | connections to the servers through looking up a statically assigned | |
212 | hash table by their source IP addresses. | |
213 | ||
214 | If you want to compile it in kernel, say Y. To compile it as a | |
215 | module, choose M here. If unsure, say N. | |
216 | ||
217 | config IP_VS_SED | |
218 | tristate "shortest expected delay scheduling" | |
1da177e4 LT |
219 | ---help--- |
220 | The shortest expected delay scheduling algorithm assigns network | |
221 | connections to the server with the shortest expected delay. The | |
222 | expected delay that the job will experience is (Ci + 1) / Ui if | |
223 | sent to the ith server, in which Ci is the number of connections | |
cab00891 | 224 | on the ith server and Ui is the fixed service rate (weight) |
1da177e4 LT |
225 | of the ith server. |
226 | ||
227 | If you want to compile it in kernel, say Y. To compile it as a | |
228 | module, choose M here. If unsure, say N. | |
229 | ||
230 | config IP_VS_NQ | |
231 | tristate "never queue scheduling" | |
1da177e4 LT |
232 | ---help--- |
233 | The never queue scheduling algorithm adopts a two-speed model. | |
234 | When there is an idle server available, the job will be sent to | |
235 | the idle server, instead of waiting for a fast one. When there | |
236 | is no idle server available, the job will be sent to the server | |
237 | that minimize its expected delay (The Shortest Expected Delay | |
238 | scheduling algorithm). | |
239 | ||
240 | If you want to compile it in kernel, say Y. To compile it as a | |
241 | module, choose M here. If unsure, say N. | |
242 | ||
76ad94fc MM |
243 | comment 'IPVS SH scheduler' |
244 | ||
245 | config IP_VS_SH_TAB_BITS | |
246 | int "IPVS source hashing table size (the Nth power of 2)" | |
247 | range 4 20 | |
248 | default 8 | |
249 | ---help--- | |
250 | The source hashing scheduler maps source IPs to destinations | |
251 | stored in a hash table. This table is tiled by each destination | |
252 | until all slots in the table are filled. When using weights to | |
253 | allow destinations to receive more connections, the table is | |
254 | tiled an amount proportional to the weights specified. The table | |
255 | needs to be large enough to effectively fit all the destinations | |
256 | multiplied by their respective weights. | |
257 | ||
1da177e4 | 258 | comment 'IPVS application helper' |
1da177e4 LT |
259 | |
260 | config IP_VS_FTP | |
261 | tristate "FTP protocol helper" | |
aaea4ed7 JA |
262 | depends on IP_VS_PROTO_TCP && NF_CONNTRACK && NF_NAT && \ |
263 | NF_CONNTRACK_FTP | |
f4bc17cd | 264 | select IP_VS_NFCT |
1da177e4 LT |
265 | ---help--- |
266 | FTP is a protocol that transfers IP address and/or port number in | |
267 | the payload. In the virtual server via Network Address Translation, | |
268 | the IP address and port number of real servers cannot be sent to | |
269 | clients in ftp connections directly, so FTP protocol helper is | |
270 | required for tracking the connection and mangling it back to that of | |
271 | virtual service. | |
272 | ||
273 | If you want to compile it in kernel, say Y. To compile it as a | |
274 | module, choose M here. If unsure, say N. | |
275 | ||
f4bc17cd JA |
276 | config IP_VS_NFCT |
277 | bool "Netfilter connection tracking" | |
278 | depends on NF_CONNTRACK | |
279 | ---help--- | |
280 | The Netfilter connection tracking support allows the IPVS | |
281 | connection state to be exported to the Netfilter framework | |
282 | for filtering purposes. | |
283 | ||
758ff033 SH |
284 | config IP_VS_PE_SIP |
285 | tristate "SIP persistence engine" | |
286 | depends on IP_VS_PROTO_UDP | |
287 | depends on NF_CONNTRACK_SIP | |
288 | ---help--- | |
289 | Allow persistence based on the SIP Call-ID | |
290 | ||
a6938a1e | 291 | endif # IP_VS |