[net-next-2.6.git] / net / ipv4 / ipvs / Kconfig

#
# IP Virtual Server configuration
#
menuconfig IP_VS
	tristate "IP virtual server support (EXPERIMENTAL)"
	depends on NETFILTER
	---help---
	  IP Virtual Server support will let you build a high-performance
	  virtual server based on cluster of two or more real servers. This
	  option must be enabled for at least one of the clustered computers
	  that will take care of intercepting incoming connections to a
	  single IP address and scheduling them to real servers.

	  Three request dispatching techniques are implemented, they are
	  virtual server via NAT, virtual server via tunneling and virtual
	  server via direct routing. The several scheduling algorithms can
	  be used to choose which server the connection is directed to,
	  thus load balancing can be achieved among the servers.  For more
	  information and its administration program, please visit the
	  following URL: <http://www.linuxvirtualserver.org/>.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

if IP_VS

config	IP_VS_DEBUG
	bool "IP virtual server debugging"
	---help---
	  Say Y here if you want to get additional messages useful in
	  debugging the IP virtual server code. You can change the debug
	  level in /proc/sys/net/ipv4/vs/debug_level

config	IP_VS_TAB_BITS
	int "IPVS connection table size (the Nth power of 2)"
	default "12" 
	---help---
	  The IPVS connection hash table uses the chaining scheme to handle
	  hash collisions. Using a big IPVS connection hash table will greatly
	  reduce conflicts when there are hundreds of thousands of connections
	  in the hash table.

	  Note the table size must be power of 2. The table size will be the
	  value of 2 to the your input number power. The number to choose is
	  from 8 to 20, the default number is 12, which means the table size
	  is 4096. Don't input the number too small, otherwise you will lose
	  performance on it. You can adapt the table size yourself, according
	  to your virtual server application. It is good to set the table size
	  not far less than the number of connections per second multiplying
	  average lasting time of connection in the table.  For example, your
	  virtual server gets 200 connections per second, the connection lasts
	  for 200 seconds in average in the connection table, the table size
	  should be not far less than 200x200, it is good to set the table
	  size 32768 (2**15).

	  Another note that each connection occupies 128 bytes effectively and
	  each hash entry uses 8 bytes, so you can estimate how much memory is
	  needed for your box.

comment "IPVS transport protocol load balancing support"

config	IP_VS_PROTO_TCP
	bool "TCP load balancing support"
	---help---
	  This option enables support for load balancing TCP transport
	  protocol. Say Y if unsure.

config	IP_VS_PROTO_UDP
	bool "UDP load balancing support"
	---help---
	  This option enables support for load balancing UDP transport
	  protocol. Say Y if unsure.

config	IP_VS_PROTO_AH_ESP
	bool
	depends on UNDEFINED

config	IP_VS_PROTO_ESP
	bool "ESP load balancing support"
	select IP_VS_PROTO_AH_ESP
	---help---
	  This option enables support for load balancing ESP (Encapsulation
	  Security Payload) transport protocol. Say Y if unsure.

config	IP_VS_PROTO_AH
	bool "AH load balancing support"
	select IP_VS_PROTO_AH_ESP
	---help---
	  This option enables support for load balancing AH (Authentication
	  Header) transport protocol. Say Y if unsure.

comment "IPVS scheduler"

config	IP_VS_RR
	tristate "round-robin scheduling"
	---help---
	  The robin-robin scheduling algorithm simply directs network
	  connections to different real servers in a round-robin manner.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.
 
config	IP_VS_WRR
        tristate "weighted round-robin scheduling" 
	---help---
	  The weighted robin-robin scheduling algorithm directs network
	  connections to different real servers based on server weights
	  in a round-robin manner. Servers with higher weights receive
	  new connections first than those with less weights, and servers
	  with higher weights get more connections than those with less
	  weights and servers with equal weights get equal connections.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_LC
        tristate "least-connection scheduling"
	---help---
	  The least-connection scheduling algorithm directs network
	  connections to the server with the least number of active 
	  connections.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_WLC
        tristate "weighted least-connection scheduling"
	---help---
	  The weighted least-connection scheduling algorithm directs network
	  connections to the server with the least active connections
	  normalized by the server weight.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_LBLC
	tristate "locality-based least-connection scheduling"
	---help---
	  The locality-based least-connection scheduling algorithm is for
	  destination IP load balancing. It is usually used in cache cluster.
	  This algorithm usually directs packet destined for an IP address to
	  its server if the server is alive and under load. If the server is
	  overloaded (its active connection numbers is larger than its weight)
	  and there is a server in its half load, then allocate the weighted
	  least-connection server to this IP address.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config  IP_VS_LBLCR
	tristate "locality-based least-connection with replication scheduling"
	---help---
	  The locality-based least-connection with replication scheduling
	  algorithm is also for destination IP load balancing. It is 
	  usually used in cache cluster. It differs from the LBLC scheduling
	  as follows: the load balancer maintains mappings from a target
	  to a set of server nodes that can serve the target. Requests for
	  a target are assigned to the least-connection node in the target's
	  server set. If all the node in the server set are over loaded,
	  it picks up a least-connection node in the cluster and adds it
	  in the sever set for the target. If the server set has not been
	  modified for the specified time, the most loaded node is removed
	  from the server set, in order to avoid high degree of replication.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_DH
	tristate "destination hashing scheduling"
	---help---
	  The destination hashing scheduling algorithm assigns network
	  connections to the servers through looking up a statically assigned
	  hash table by their destination IP addresses.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_SH
	tristate "source hashing scheduling"
	---help---
	  The source hashing scheduling algorithm assigns network
	  connections to the servers through looking up a statically assigned
	  hash table by their source IP addresses.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_SED
	tristate "shortest expected delay scheduling"
	---help---
	  The shortest expected delay scheduling algorithm assigns network
	  connections to the server with the shortest expected delay. The 
	  expected delay that the job will experience is (Ci + 1) / Ui if 
	  sent to the ith server, in which Ci is the number of connections
	  on the ith server and Ui is the fixed service rate (weight)
	  of the ith server.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

config	IP_VS_NQ
	tristate "never queue scheduling"
	---help---
	  The never queue scheduling algorithm adopts a two-speed model.
	  When there is an idle server available, the job will be sent to
	  the idle server, instead of waiting for a fast one. When there
	  is no idle server available, the job will be sent to the server
	  that minimize its expected delay (The Shortest Expected Delay
	  scheduling algorithm).

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

comment 'IPVS application helper'

config	IP_VS_FTP
  	tristate "FTP protocol helper"
        depends on IP_VS_PROTO_TCP
	---help---
	  FTP is a protocol that transfers IP address and/or port number in
	  the payload. In the virtual server via Network Address Translation,
	  the IP address and port number of real servers cannot be sent to
	  clients in ftp connections directly, so FTP protocol helper is
	  required for tracking the connection and mangling it back to that of
	  virtual service.

	  If you want to compile it in kernel, say Y. To compile it as a
	  module, choose M here. If unsure, say N.

endif # IP_VS
Commit	Line	Data
1da177e4 LT	1	#
	2	# IP Virtual Server configuration
	3	#
a6938a1e	4	menuconfig IP_VS
1da177e4	5	tristate "IP virtual server support (EXPERIMENTAL)"
6a2e9b73	6	depends on 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
a6938a1e JE	26
1da177e4 LT	27	config IP_VS_DEBUG
1da177e4 LT	28	bool "IP virtual server debugging"
1da177e4 LT	29	---help---
	30	Say Y here if you want to get additional messages useful in
	31	debugging the IP virtual server code. You can change the debug
	32	level in /proc/sys/net/ipv4/vs/debug_level
	33
	34	config IP_VS_TAB_BITS
	35	int "IPVS connection table size (the Nth power of 2)"
1da177e4 LT	36	default "12"
	37	---help---
	38	The IPVS connection hash table uses the chaining scheme to handle
	39	hash collisions. Using a big IPVS connection hash table will greatly
	40	reduce conflicts when there are hundreds of thousands of connections
	41	in the hash table.
	42
	43	Note the table size must be power of 2. The table size will be the
	44	value of 2 to the your input number power. The number to choose is
	45	from 8 to 20, the default number is 12, which means the table size
	46	is 4096. Don't input the number too small, otherwise you will lose
	47	performance on it. You can adapt the table size yourself, according
	48	to your virtual server application. It is good to set the table size
	49	not far less than the number of connections per second multiplying
	50	average lasting time of connection in the table. For example, your
	51	virtual server gets 200 connections per second, the connection lasts
	52	for 200 seconds in average in the connection table, the table size
	53	should be not far less than 200x200, it is good to set the table
	54	size 32768 (2**15).
	55
	56	Another note that each connection occupies 128 bytes effectively and
	57	each hash entry uses 8 bytes, so you can estimate how much memory is
	58	needed for your box.
	59
	60	comment "IPVS transport protocol load balancing support"
1da177e4 LT	61
	62	config IP_VS_PROTO_TCP
	63	bool "TCP load balancing support"
1da177e4 LT	64	---help---
	65	This option enables support for load balancing TCP transport
	66	protocol. Say Y if unsure.
	67
	68	config IP_VS_PROTO_UDP
	69	bool "UDP load balancing support"
1da177e4 LT	70	---help---
	71	This option enables support for load balancing UDP transport
	72	protocol. Say Y if unsure.
	73
409a1966 JV	74	config IP_VS_PROTO_AH_ESP
	75	bool
	76	depends on UNDEFINED
	77
1da177e4 LT	78	config IP_VS_PROTO_ESP
1da177e4 LT	79	bool "ESP load balancing support"
409a1966	80	select IP_VS_PROTO_AH_ESP
1da177e4	81	---help---
44c09201	82	This option enables support for load balancing ESP (Encapsulation
1da177e4 LT	83	Security Payload) transport protocol. Say Y if unsure.
	84
	85	config IP_VS_PROTO_AH
	86	bool "AH load balancing support"
409a1966	87	select IP_VS_PROTO_AH_ESP
1da177e4 LT	88	---help---
	89	This option enables support for load balancing AH (Authentication
	90	Header) transport protocol. Say Y if unsure.
	91
	92	comment "IPVS scheduler"
1da177e4 LT	93
	94	config IP_VS_RR
	95	tristate "round-robin scheduling"
1da177e4 LT	96	---help---
	97	The robin-robin scheduling algorithm simply directs network
	98	connections to different real servers in a round-robin manner.
	99
	100	If you want to compile it in kernel, say Y. To compile it as a
	101	module, choose M here. If unsure, say N.
	102
	103	config IP_VS_WRR
	104	tristate "weighted round-robin scheduling"
1da177e4 LT	105	---help---
	106	The weighted robin-robin scheduling algorithm directs network
	107	connections to different real servers based on server weights
	108	in a round-robin manner. Servers with higher weights receive
	109	new connections first than those with less weights, and servers
	110	with higher weights get more connections than those with less
	111	weights and servers with equal weights get equal connections.
	112
	113	If you want to compile it in kernel, say Y. To compile it as a
	114	module, choose M here. If unsure, say N.
	115
	116	config IP_VS_LC
	117	tristate "least-connection scheduling"
1da177e4 LT	118	---help---
	119	The least-connection scheduling algorithm directs network
	120	connections to the server with the least number of active
	121	connections.
	122
	123	If you want to compile it in kernel, say Y. To compile it as a
	124	module, choose M here. If unsure, say N.
	125
	126	config IP_VS_WLC
	127	tristate "weighted least-connection scheduling"
1da177e4 LT	128	---help---
	129	The weighted least-connection scheduling algorithm directs network
	130	connections to the server with the least active connections
	131	normalized by the server weight.
	132
	133	If you want to compile it in kernel, say Y. To compile it as a
	134	module, choose M here. If unsure, say N.
	135
	136	config IP_VS_LBLC
	137	tristate "locality-based least-connection scheduling"
1da177e4 LT	138	---help---
	139	The locality-based least-connection scheduling algorithm is for
	140	destination IP load balancing. It is usually used in cache cluster.
	141	This algorithm usually directs packet destined for an IP address to
	142	its server if the server is alive and under load. If the server is
	143	overloaded (its active connection numbers is larger than its weight)
	144	and there is a server in its half load, then allocate the weighted
	145	least-connection server to this IP address.
	146
	147	If you want to compile it in kernel, say Y. To compile it as a
	148	module, choose M here. If unsure, say N.
	149
	150	config IP_VS_LBLCR
	151	tristate "locality-based least-connection with replication scheduling"
1da177e4 LT	152	---help---
	153	The locality-based least-connection with replication scheduling
	154	algorithm is also for destination IP load balancing. It is
	155	usually used in cache cluster. It differs from the LBLC scheduling
	156	as follows: the load balancer maintains mappings from a target
	157	to a set of server nodes that can serve the target. Requests for
	158	a target are assigned to the least-connection node in the target's
	159	server set. If all the node in the server set are over loaded,
	160	it picks up a least-connection node in the cluster and adds it
	161	in the sever set for the target. If the server set has not been
	162	modified for the specified time, the most loaded node is removed
	163	from the server set, in order to avoid high degree of replication.
	164
	165	If you want to compile it in kernel, say Y. To compile it as a
	166	module, choose M here. If unsure, say N.
	167
	168	config IP_VS_DH
	169	tristate "destination hashing scheduling"
1da177e4 LT	170	---help---
	171	The destination hashing scheduling algorithm assigns network
	172	connections to the servers through looking up a statically assigned
	173	hash table by their destination IP addresses.
	174
	175	If you want to compile it in kernel, say Y. To compile it as a
	176	module, choose M here. If unsure, say N.
	177
	178	config IP_VS_SH
	179	tristate "source hashing scheduling"
1da177e4 LT	180	---help---
	181	The source hashing scheduling algorithm assigns network
	182	connections to the servers through looking up a statically assigned
	183	hash table by their source IP addresses.
	184
	185	If you want to compile it in kernel, say Y. To compile it as a
	186	module, choose M here. If unsure, say N.
	187
	188	config IP_VS_SED
	189	tristate "shortest expected delay scheduling"
1da177e4 LT	190	---help---
	191	The shortest expected delay scheduling algorithm assigns network
	192	connections to the server with the shortest expected delay. The
	193	expected delay that the job will experience is (Ci + 1) / Ui if
	194	sent to the ith server, in which Ci is the number of connections
cab00891	195	on the ith server and Ui is the fixed service rate (weight)
1da177e4 LT	196	of the ith server.
	197
	198	If you want to compile it in kernel, say Y. To compile it as a
	199	module, choose M here. If unsure, say N.
	200
	201	config IP_VS_NQ
	202	tristate "never queue scheduling"
1da177e4 LT	203	---help---
	204	The never queue scheduling algorithm adopts a two-speed model.
	205	When there is an idle server available, the job will be sent to
	206	the idle server, instead of waiting for a fast one. When there
	207	is no idle server available, the job will be sent to the server
	208	that minimize its expected delay (The Shortest Expected Delay
	209	scheduling algorithm).
	210
	211	If you want to compile it in kernel, say Y. To compile it as a
	212	module, choose M here. If unsure, say N.
	213
	214	comment 'IPVS application helper'
1da177e4 LT	215
	216	config IP_VS_FTP
	217	tristate "FTP protocol helper"
a6938a1e	218	depends on IP_VS_PROTO_TCP
1da177e4 LT	219	---help---
	220	FTP is a protocol that transfers IP address and/or port number in
	221	the payload. In the virtual server via Network Address Translation,
	222	the IP address and port number of real servers cannot be sent to
	223	clients in ftp connections directly, so FTP protocol helper is
	224	required for tracking the connection and mangling it back to that of
	225	virtual service.
	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
a6938a1e	230	endif # IP_VS