Version:  2.6.34 2.6.35 2.6.36 2.6.37 2.6.38 2.6.39 3.0 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10 3.11 3.12 3.13 3.14

Linux/net/netfilter/ipvs/Kconfig

  1 #
  2 # IP Virtual Server configuration
  3 #
  4 menuconfig IP_VS
  5         tristate "IP virtual server support"
  6         depends on NET && INET && NETFILTER
  7         depends on (NF_CONNTRACK || NF_CONNTRACK=n)
  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 
 26 if IP_VS
 27 
 28 config  IP_VS_IPV6
 29         bool "IPv6 support for IPVS"
 30         depends on IPV6 = y || IP_VS = IPV6
 31         select IP6_NF_IPTABLES
 32         ---help---
 33           Add IPv6 support to IPVS.
 34 
 35           Say Y if unsure.
 36 
 37 config  IP_VS_DEBUG
 38         bool "IP virtual server debugging"
 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)"
 46         range 8 20
 47         default 12
 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           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 
 75 comment "IPVS transport protocol load balancing support"
 76 
 77 config  IP_VS_PROTO_TCP
 78         bool "TCP load balancing support"
 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"
 85         ---help---
 86           This option enables support for load balancing UDP transport
 87           protocol. Say Y if unsure.
 88 
 89 config  IP_VS_PROTO_AH_ESP
 90         def_bool IP_VS_PROTO_ESP || IP_VS_PROTO_AH
 91 
 92 config  IP_VS_PROTO_ESP
 93         bool "ESP load balancing support"
 94         ---help---
 95           This option enables support for load balancing ESP (Encapsulation
 96           Security Payload) transport protocol. Say Y if unsure.
 97 
 98 config  IP_VS_PROTO_AH
 99         bool "AH load balancing support"
100         ---help---
101           This option enables support for load balancing AH (Authentication
102           Header) transport protocol. Say Y if unsure.
103 
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 
111 comment "IPVS scheduler"
112 
113 config  IP_VS_RR
114         tristate "round-robin scheduling"
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
123         tristate "weighted round-robin scheduling"
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"
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"
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.
154 
155 config  IP_VS_LBLC
156         tristate "locality-based least-connection scheduling"
157         ---help---
158           The locality-based least-connection scheduling algorithm is for
159           destination IP load balancing. It is usually used in cache cluster.
160           This algorithm usually directs packet destined for an IP address to
161           its server if the server is alive and under load. If the server is
162           overloaded (its active connection numbers is larger than its weight)
163           and there is a server in its half load, then allocate the weighted
164           least-connection server to this IP address.
165 
166           If you want to compile it in kernel, say Y. To compile it as a
167           module, choose M here. If unsure, say N.
168 
169 config  IP_VS_LBLCR
170         tristate "locality-based least-connection with replication scheduling"
171         ---help---
172           The locality-based least-connection with replication scheduling
173           algorithm is also for destination IP load balancing. It is 
174           usually used in cache cluster. It differs from the LBLC scheduling
175           as follows: the load balancer maintains mappings from a target
176           to a set of server nodes that can serve the target. Requests for
177           a target are assigned to the least-connection node in the target's
178           server set. If all the node in the server set are over loaded,
179           it picks up a least-connection node in the cluster and adds it
180           in the sever set for the target. If the server set has not been
181           modified for the specified time, the most loaded node is removed
182           from the server set, in order to avoid high degree of replication.
183 
184           If you want to compile it in kernel, say Y. To compile it as a
185           module, choose M here. If unsure, say N.
186 
187 config  IP_VS_DH
188         tristate "destination hashing scheduling"
189         ---help---
190           The destination hashing scheduling algorithm assigns network
191           connections to the servers through looking up a statically assigned
192           hash table by their destination IP addresses.
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_SH
198         tristate "source hashing scheduling"
199         ---help---
200           The source hashing scheduling algorithm assigns network
201           connections to the servers through looking up a statically assigned
202           hash table by their source 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_SED
208         tristate "shortest expected delay scheduling"
209         ---help---
210           The shortest expected delay scheduling algorithm assigns network
211           connections to the server with the shortest expected delay. The 
212           expected delay that the job will experience is (Ci + 1) / Ui if 
213           sent to the ith server, in which Ci is the number of connections
214           on the ith server and Ui is the fixed service rate (weight)
215           of the ith server.
216 
217           If you want to compile it in kernel, say Y. To compile it as a
218           module, choose M here. If unsure, say N.
219 
220 config  IP_VS_NQ
221         tristate "never queue scheduling"
222         ---help---
223           The never queue scheduling algorithm adopts a two-speed model.
224           When there is an idle server available, the job will be sent to
225           the idle server, instead of waiting for a fast one. When there
226           is no idle server available, the job will be sent to the server
227           that minimize its expected delay (The Shortest Expected Delay
228           scheduling algorithm).
229 
230           If you want to compile it in kernel, say Y. To compile it as a
231           module, choose M here. If unsure, say N.
232 
233 comment 'IPVS SH scheduler'
234 
235 config IP_VS_SH_TAB_BITS
236         int "IPVS source hashing table size (the Nth power of 2)"
237         range 4 20
238         default 8
239         ---help---
240           The source hashing scheduler maps source IPs to destinations
241           stored in a hash table. This table is tiled by each destination
242           until all slots in the table are filled. When using weights to
243           allow destinations to receive more connections, the table is
244           tiled an amount proportional to the weights specified. The table
245           needs to be large enough to effectively fit all the destinations
246           multiplied by their respective weights.
247 
248 comment 'IPVS application helper'
249 
250 config  IP_VS_FTP
251         tristate "FTP protocol helper"
252         depends on IP_VS_PROTO_TCP && NF_CONNTRACK && NF_NAT && \
253                 NF_CONNTRACK_FTP
254         select IP_VS_NFCT
255         ---help---
256           FTP is a protocol that transfers IP address and/or port number in
257           the payload. In the virtual server via Network Address Translation,
258           the IP address and port number of real servers cannot be sent to
259           clients in ftp connections directly, so FTP protocol helper is
260           required for tracking the connection and mangling it back to that of
261           virtual service.
262 
263           If you want to compile it in kernel, say Y. To compile it as a
264           module, choose M here. If unsure, say N.
265 
266 config  IP_VS_NFCT
267         bool "Netfilter connection tracking"
268         depends on NF_CONNTRACK
269         ---help---
270           The Netfilter connection tracking support allows the IPVS
271           connection state to be exported to the Netfilter framework
272           for filtering purposes.
273 
274 config  IP_VS_PE_SIP
275         tristate "SIP persistence engine"
276         depends on IP_VS_PROTO_UDP
277         depends on NF_CONNTRACK_SIP
278         ---help---
279           Allow persistence based on the SIP Call-ID
280 
281 endif # IP_VS

This page was automatically generated by LXR 0.3.1 (source).  •  Linux is a registered trademark of Linus Torvalds  •  Contact us