设为首页 收藏本站
查看: 816|回复: 0

[经验分享] LVS的10中调度算法

[复制链接]

尚未签到

发表于 2019-1-4 09:48:08 | 显示全部楼层 |阅读模式
  LVS中的可以分成静态和动态两种算法,而每种算法下面还有其他算法:
  

  四种静态:
  rr
  wrr
  dh
  sh
  

  四种动态:
  lc: 最少连接。
  如何计算哪个连接多哪个连接少呢?
  计算当前后端每一个realserver的活动连接数和非活动连接数的总数并进行比较,哪一个数目小,则选择哪一个。
  active*256+inactive(谁的数量小,那么选择)。
  wlc:加权最少连接。
  比较方法:active*256+inactive / weight,谁的数字小,选择。
  sed:最短期望延迟(对wlc改进的算法),权重大优先被选择。
  算法: (active+1)*256 / weight

  nq: never queue,从不排队(sed的改进)。每个动发一个,然后再计算。
  lblc:基于本地的最少连接。
  考虑cache的连接数
  缺点:游客能破坏命中率。
  lblcr:基于本地带复制功能的最少连接。
  

  lvs默认算法:wlc

  

  

  

  

  What's the lvs?

  

  Linux virtual server is the high available and high scalable server built on a cluster server, with the load balancedr running on the Linux opearting system.
  

  there are 10 schedulers. the schedulers are rr, wrr, lc, wlc, lblc, lblcr, dh, sh.
  

  I just looked at them. I need write them on my blog so that looking in the future.
  

  Round Robin(rr), Weighted round robin(wrr) - new connections are assigned to each realserver in turn.
  

  different: the server's load will have been detection and adjust dynamic by wrr schedulers. rr will not adjust.
  

  Least connections(lc), Weighted least connections(wlc) - new connections come to realserver with the least number of connections.
  

  different:same the rr and wrr
  

  Locality-based least connections (lblc), Locality-based least with replication(lblcr)
  The LBLC code (by Wensong) and the DH scheduler (by Wensong, inspired by code submitted by Thomas Proell proellt (at) gmx (dot) de) are designed for web caching realservers (e.g. squids). For normal LVS services (eg ftp, http), the content offered by each realserver is the same and it doesn't matter which realserver the client is connected to. For a web cache, after the first fetch has been made, the web caches have different content. As more pages are fetched, the contents of the web caches will diverge. Since the web caches will be setup as peers, they can communicate by ICP (internet caching protocol) to find the cache(s) with the required page. This is faster than fetching the page from the original webserver. However, it would be better after the first fetch of a page from http://www.foo.com/*, for all subsequent clients wanting a page from http://www.foo.com/ to be connected to that realserver.
  

  different:用于cache集群系统,两者一个是服务器,一个是服务器群。
  

  Destination Hashing(DH), Source Hashing(SH)
  

  The DH scheduler can keep the two load balancer redirect requests destined for the same IP address to the same cache server. If the server is dead or overloaded, the load balancer can use cache_bypass feature to send requests to the original server directly. (Make sure that the cache servers are added in the two load balancers in the same order)




运维网声明 1、欢迎大家加入本站运维交流群:群②:261659950 群⑤:202807635 群⑦870801961 群⑧679858003
2、本站所有主题由该帖子作者发表,该帖子作者与运维网享有帖子相关版权
3、所有作品的著作权均归原作者享有,请您和我们一样尊重他人的著作权等合法权益。如果您对作品感到满意,请购买正版
4、禁止制作、复制、发布和传播具有反动、淫秽、色情、暴力、凶杀等内容的信息,一经发现立即删除。若您因此触犯法律,一切后果自负,我们对此不承担任何责任
5、所有资源均系网友上传或者通过网络收集,我们仅提供一个展示、介绍、观摩学习的平台,我们不对其内容的准确性、可靠性、正当性、安全性、合法性等负责,亦不承担任何法律责任
6、所有作品仅供您个人学习、研究或欣赏,不得用于商业或者其他用途,否则,一切后果均由您自己承担,我们对此不承担任何法律责任
7、如涉及侵犯版权等问题,请您及时通知我们,我们将立即采取措施予以解决
8、联系人Email:admin@iyunv.com 网址:www.yunweiku.com

所有资源均系网友上传或者通过网络收集,我们仅提供一个展示、介绍、观摩学习的平台,我们不对其承担任何法律责任,如涉及侵犯版权等问题,请您及时通知我们,我们将立即处理,联系人Email:kefu@iyunv.com,QQ:1061981298 本贴地址:https://www.yunweiku.com/thread-659194-1-1.html 上篇帖子: 企业级负载均衡LVS的实现 下篇帖子: Lvs NAT模型
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

扫码加入运维网微信交流群X

扫码加入运维网微信交流群

扫描二维码加入运维网微信交流群,最新一手资源尽在官方微信交流群!快快加入我们吧...

扫描微信二维码查看详情

客服E-mail:kefu@iyunv.com 客服QQ:1061981298


QQ群⑦:运维网交流群⑦ QQ群⑧:运维网交流群⑧ k8s群:运维网kubernetes交流群


提醒:禁止发布任何违反国家法律、法规的言论与图片等内容;本站内容均来自个人观点与网络等信息,非本站认同之观点.


本站大部分资源是网友从网上搜集分享而来,其版权均归原作者及其网站所有,我们尊重他人的合法权益,如有内容侵犯您的合法权益,请及时与我们联系进行核实删除!



合作伙伴: 青云cloud

快速回复 返回顶部 返回列表