/net/netfilter/ipvs/Kconfig

https://bitbucket.org/abioy/linux · #! · 253 lines · 210 code · 43 blank · 0 comment · 0 complexity · 09e89eecda2c1f7082e56ec076a4769a MD5 · raw file

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