Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | # |
2 | # IP Virtual Server configuration | |
3 | # | |
a6938a1e | 4 | menuconfig IP_VS |
f901b644 DM |
5 | tristate "IP virtual server support" |
6 | depends on NET && INET && NETFILTER | |
1da177e4 LT |
7 | ---help--- |
8 | IP Virtual Server support will let you build a high-performance | |
9 | virtual server based on cluster of two or more real servers. This | |
10 | option must be enabled for at least one of the clustered computers | |
11 | that will take care of intercepting incoming connections to a | |
12 | single IP address and scheduling them to real servers. | |
13 | ||
14 | Three request dispatching techniques are implemented, they are | |
15 | virtual server via NAT, virtual server via tunneling and virtual | |
16 | server via direct routing. The several scheduling algorithms can | |
17 | be used to choose which server the connection is directed to, | |
18 | thus load balancing can be achieved among the servers. For more | |
19 | information and its administration program, please visit the | |
20 | following URL: <http://www.linuxvirtualserver.org/>. | |
21 | ||
22 | If you want to compile it in kernel, say Y. To compile it as a | |
23 | module, choose M here. If unsure, say N. | |
24 | ||
a6938a1e JE |
25 | if IP_VS |
26 | ||
fab0de02 | 27 | config IP_VS_IPV6 |
0537ae6a | 28 | bool "IPv6 support for IPVS" |
fab0de02 JV |
29 | depends on EXPERIMENTAL && (IPV6 = y || IP_VS = IPV6) |
30 | ---help--- | |
31 | Add IPv6 support to IPVS. This is incomplete and might be dangerous. | |
32 | ||
0537ae6a JV |
33 | See http://www.mindbasket.com/ipvs for more information. |
34 | ||
fab0de02 JV |
35 | Say N if unsure. |
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 | ||
71 | comment "IPVS transport protocol load balancing support" | |
1da177e4 LT |
72 | |
73 | config IP_VS_PROTO_TCP | |
74 | bool "TCP load balancing support" | |
1da177e4 LT |
75 | ---help--- |
76 | This option enables support for load balancing TCP transport | |
77 | protocol. Say Y if unsure. | |
78 | ||
79 | config IP_VS_PROTO_UDP | |
80 | bool "UDP load balancing support" | |
1da177e4 LT |
81 | ---help--- |
82 | This option enables support for load balancing UDP transport | |
83 | protocol. Say Y if unsure. | |
84 | ||
409a1966 JV |
85 | config IP_VS_PROTO_AH_ESP |
86 | bool | |
87 | depends on UNDEFINED | |
88 | ||
1da177e4 LT |
89 | config IP_VS_PROTO_ESP |
90 | bool "ESP load balancing support" | |
409a1966 | 91 | select IP_VS_PROTO_AH_ESP |
1da177e4 | 92 | ---help--- |
44c09201 | 93 | This option enables support for load balancing ESP (Encapsulation |
1da177e4 LT |
94 | Security Payload) transport protocol. Say Y if unsure. |
95 | ||
96 | config IP_VS_PROTO_AH | |
97 | bool "AH load balancing support" | |
409a1966 | 98 | select IP_VS_PROTO_AH_ESP |
1da177e4 LT |
99 | ---help--- |
100 | This option enables support for load balancing AH (Authentication | |
101 | Header) transport protocol. Say Y if unsure. | |
102 | ||
103 | comment "IPVS scheduler" | |
1da177e4 LT |
104 | |
105 | config IP_VS_RR | |
106 | tristate "round-robin scheduling" | |
1da177e4 LT |
107 | ---help--- |
108 | The robin-robin scheduling algorithm simply directs network | |
109 | connections to different real servers in a round-robin manner. | |
110 | ||
111 | If you want to compile it in kernel, say Y. To compile it as a | |
112 | module, choose M here. If unsure, say N. | |
113 | ||
114 | config IP_VS_WRR | |
115 | tristate "weighted round-robin scheduling" | |
1da177e4 LT |
116 | ---help--- |
117 | The weighted robin-robin scheduling algorithm directs network | |
118 | connections to different real servers based on server weights | |
119 | in a round-robin manner. Servers with higher weights receive | |
120 | new connections first than those with less weights, and servers | |
121 | with higher weights get more connections than those with less | |
122 | weights and servers with equal weights get equal connections. | |
123 | ||
124 | If you want to compile it in kernel, say Y. To compile it as a | |
125 | module, choose M here. If unsure, say N. | |
126 | ||
127 | config IP_VS_LC | |
128 | tristate "least-connection scheduling" | |
1da177e4 LT |
129 | ---help--- |
130 | The least-connection scheduling algorithm directs network | |
131 | connections to the server with the least number of active | |
132 | connections. | |
133 | ||
134 | If you want to compile it in kernel, say Y. To compile it as a | |
135 | module, choose M here. If unsure, say N. | |
136 | ||
137 | config IP_VS_WLC | |
138 | tristate "weighted least-connection scheduling" | |
1da177e4 LT |
139 | ---help--- |
140 | The weighted least-connection scheduling algorithm directs network | |
141 | connections to the server with the least active connections | |
142 | normalized by the server weight. | |
143 | ||
144 | If you want to compile it in kernel, say Y. To compile it as a | |
145 | module, choose M here. If unsure, say N. | |
146 | ||
147 | config IP_VS_LBLC | |
148 | tristate "locality-based least-connection scheduling" | |
1da177e4 LT |
149 | ---help--- |
150 | The locality-based least-connection scheduling algorithm is for | |
151 | destination IP load balancing. It is usually used in cache cluster. | |
152 | This algorithm usually directs packet destined for an IP address to | |
153 | its server if the server is alive and under load. If the server is | |
154 | overloaded (its active connection numbers is larger than its weight) | |
155 | and there is a server in its half load, then allocate the weighted | |
156 | least-connection server to this IP address. | |
157 | ||
158 | If you want to compile it in kernel, say Y. To compile it as a | |
159 | module, choose M here. If unsure, say N. | |
160 | ||
161 | config IP_VS_LBLCR | |
162 | tristate "locality-based least-connection with replication scheduling" | |
1da177e4 LT |
163 | ---help--- |
164 | The locality-based least-connection with replication scheduling | |
165 | algorithm is also for destination IP load balancing. It is | |
166 | usually used in cache cluster. It differs from the LBLC scheduling | |
167 | as follows: the load balancer maintains mappings from a target | |
168 | to a set of server nodes that can serve the target. Requests for | |
169 | a target are assigned to the least-connection node in the target's | |
170 | server set. If all the node in the server set are over loaded, | |
171 | it picks up a least-connection node in the cluster and adds it | |
172 | in the sever set for the target. If the server set has not been | |
173 | modified for the specified time, the most loaded node is removed | |
174 | from the server set, in order to avoid high degree of replication. | |
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_DH | |
180 | tristate "destination hashing scheduling" | |
1da177e4 LT |
181 | ---help--- |
182 | The destination hashing scheduling algorithm assigns network | |
183 | connections to the servers through looking up a statically assigned | |
184 | hash table by their destination IP addresses. | |
185 | ||
186 | If you want to compile it in kernel, say Y. To compile it as a | |
187 | module, choose M here. If unsure, say N. | |
188 | ||
189 | config IP_VS_SH | |
190 | tristate "source hashing scheduling" | |
1da177e4 LT |
191 | ---help--- |
192 | The source hashing scheduling algorithm assigns network | |
193 | connections to the servers through looking up a statically assigned | |
194 | hash table by their source IP addresses. | |
195 | ||
196 | If you want to compile it in kernel, say Y. To compile it as a | |
197 | module, choose M here. If unsure, say N. | |
198 | ||
199 | config IP_VS_SED | |
200 | tristate "shortest expected delay scheduling" | |
1da177e4 LT |
201 | ---help--- |
202 | The shortest expected delay scheduling algorithm assigns network | |
203 | connections to the server with the shortest expected delay. The | |
204 | expected delay that the job will experience is (Ci + 1) / Ui if | |
205 | sent to the ith server, in which Ci is the number of connections | |
cab00891 | 206 | on the ith server and Ui is the fixed service rate (weight) |
1da177e4 LT |
207 | of the ith server. |
208 | ||
209 | If you want to compile it in kernel, say Y. To compile it as a | |
210 | module, choose M here. If unsure, say N. | |
211 | ||
212 | config IP_VS_NQ | |
213 | tristate "never queue scheduling" | |
1da177e4 LT |
214 | ---help--- |
215 | The never queue scheduling algorithm adopts a two-speed model. | |
216 | When there is an idle server available, the job will be sent to | |
217 | the idle server, instead of waiting for a fast one. When there | |
218 | is no idle server available, the job will be sent to the server | |
219 | that minimize its expected delay (The Shortest Expected Delay | |
220 | scheduling algorithm). | |
221 | ||
222 | If you want to compile it in kernel, say Y. To compile it as a | |
223 | module, choose M here. If unsure, say N. | |
224 | ||
225 | comment 'IPVS application helper' | |
1da177e4 LT |
226 | |
227 | config IP_VS_FTP | |
228 | tristate "FTP protocol helper" | |
a6938a1e | 229 | depends on IP_VS_PROTO_TCP |
1da177e4 LT |
230 | ---help--- |
231 | FTP is a protocol that transfers IP address and/or port number in | |
232 | the payload. In the virtual server via Network Address Translation, | |
233 | the IP address and port number of real servers cannot be sent to | |
234 | clients in ftp connections directly, so FTP protocol helper is | |
235 | required for tracking the connection and mangling it back to that of | |
236 | virtual service. | |
237 | ||
238 | If you want to compile it in kernel, say Y. To compile it as a | |
239 | module, choose M here. If unsure, say N. | |
240 | ||
a6938a1e | 241 | endif # IP_VS |