Kconfig 10.0 KB

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