Revision as of 07:23, 26 November 2024 edit Zac67 (talk \| contribs) Extended confirmed users 11,933 edits m Reverted 1 edit by 2001:EE0:53A5:B0D0:A580:7A53:4F58:BA7E (talk) to last revision by RJFJR Tags: Twinkle Undo ← Previous edit		Revision as of 21:52, 28 December 2024 edit undo OmniClass (talk \| contribs) 18 edits No edit summary Next edit →
Line 167: =====Scheduling algorithms===== Numerous [[scheduling algorithm]]s, also called load-balancing methods, are used by load balancers to determine which back-end server to send a request to. Simple algorithms include random choice, [[Round-robin scheduling\|round robin]], or least connections.<ref name=":0">{{Cite web\|url=https://f5.com/resources/white-papers/load-balancing-101-nuts-and-bolts\|archive-url=https://web.archive.org/web/20171205223948/https://f5.com/resources/white-papers/load-balancing-101-nuts-and-bolts\|url-status=dead\|archive-date=2017-12-05\|title=Load Balancing 101: Nuts and Bolts\|date=2017-12-05\|publisher=[[F5, ~~Networks~~Inc.\|F5]]\|access-date=2018-03-23}}</ref> More sophisticated load balancers may take additional factors into account, such as a server's reported load, least response times, up/down status (determined by a monitoring poll of some kind), a number of active connections, geographic ___location, capabilities, or how much traffic it has recently been assigned. =====Persistence=====

Load balancing (computing): Difference between revisions