ip_vs_lc.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /*
  2. * IPVS: Least-Connection Scheduling module
  3. *
  4. * Authors: Wensong Zhang <wensong@linuxvirtualserver.org>
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. *
  11. * Changes:
  12. * Wensong Zhang : added the ip_vs_lc_update_svc
  13. * Wensong Zhang : added any dest with weight=0 is quiesced
  14. *
  15. */
  16. #include <linux/module.h>
  17. #include <linux/kernel.h>
  18. #include <net/ip_vs.h>
  19. static inline unsigned int
  20. ip_vs_lc_dest_overhead(struct ip_vs_dest *dest)
  21. {
  22. /*
  23. * We think the overhead of processing active connections is 256
  24. * times higher than that of inactive connections in average. (This
  25. * 256 times might not be accurate, we will change it later) We
  26. * use the following formula to estimate the overhead now:
  27. * dest->activeconns*256 + dest->inactconns
  28. */
  29. return (atomic_read(&dest->activeconns) << 8) +
  30. atomic_read(&dest->inactconns);
  31. }
  32. /*
  33. * Least Connection scheduling
  34. */
  35. static struct ip_vs_dest *
  36. ip_vs_lc_schedule(struct ip_vs_service *svc, const struct sk_buff *skb)
  37. {
  38. struct ip_vs_dest *dest, *least = NULL;
  39. unsigned int loh = 0, doh;
  40. IP_VS_DBG(6, "ip_vs_lc_schedule(): Scheduling...\n");
  41. /*
  42. * Simply select the server with the least number of
  43. * (activeconns<<5) + inactconns
  44. * Except whose weight is equal to zero.
  45. * If the weight is equal to zero, it means that the server is
  46. * quiesced, the existing connections to the server still get
  47. * served, but no new connection is assigned to the server.
  48. */
  49. list_for_each_entry(dest, &svc->destinations, n_list) {
  50. if ((dest->flags & IP_VS_DEST_F_OVERLOAD) ||
  51. atomic_read(&dest->weight) == 0)
  52. continue;
  53. doh = ip_vs_lc_dest_overhead(dest);
  54. if (!least || doh < loh) {
  55. least = dest;
  56. loh = doh;
  57. }
  58. }
  59. if (least)
  60. IP_VS_DBG_BUF(6, "LC: server %s:%u activeconns %d inactconns %d\n",
  61. IP_VS_DBG_ADDR(svc->af, &least->addr), ntohs(least->port),
  62. atomic_read(&least->activeconns),
  63. atomic_read(&least->inactconns));
  64. return least;
  65. }
  66. static struct ip_vs_scheduler ip_vs_lc_scheduler = {
  67. .name = "lc",
  68. .refcnt = ATOMIC_INIT(0),
  69. .module = THIS_MODULE,
  70. .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
  71. #ifdef CONFIG_IP_VS_IPV6
  72. .supports_ipv6 = 1,
  73. #endif
  74. .schedule = ip_vs_lc_schedule,
  75. };
  76. static int __init ip_vs_lc_init(void)
  77. {
  78. return register_ip_vs_scheduler(&ip_vs_lc_scheduler) ;
  79. }
  80. static void __exit ip_vs_lc_cleanup(void)
  81. {
  82. unregister_ip_vs_scheduler(&ip_vs_lc_scheduler);
  83. }
  84. module_init(ip_vs_lc_init);
  85. module_exit(ip_vs_lc_cleanup);
  86. MODULE_LICENSE("GPL");