RepoMirrors/haproxy
1
0
Fork 0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2025-02-17 19:16:56 +00:00
Code Issues Packages Projects Releases Wiki Activity

CLEANUP: lb_first: add reference to a paper describing the original idea

Browse Source 
The original idea behind this implementation has been published in the
paper below :

   http://reports-archive.adm.cs.cmu.edu/anon/2012/CMU-CS-12-109.pdf
This commit is contained in:
Willy Tarreau 2012-04-07 09:08:45 +02:00
parent 04aa6a9ce8
commit 64559c565f
2 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
doc/configuration.txt
View File

@ -1280,13 +1280,18 @@ balance url_param <param> [check_post [<max_wait>]]
connection. The servers are choosen from the lowest numeric
identifier to the highest (see server parameter "id"), which
defaults to the server's position in the farm. Once a server
reaaches its maxconn value, the next server is used. It does
reaches its maxconn value, the next server is used. It does
not make sense to use this algorithm without setting maxconn.
The purpose of this algorithm is to always use the smallest
number of servers so that extra servers can be powered off
during non-intensive hours. This algorithm ignores the server
weight, and brings more benefit to long session such as RDP
or IMAP than HTTP, though it can be useful there too.
or IMAP than HTTP, though it can be useful there too. In
order to use this algorithm efficiently, it is recommended
that a cloud controller regularly checks server usage to turn
them off when unused, and regularly checks backend queue to
turn new servers on when the queue inflates. Alternatively,
using "http-check send-state" may inform servers on the load.
source The source IP address is hashed and divided by the total
weight of the running servers to designate which server will

6
src/lb_fas.c
View File

@ -1,6 +1,12 @@
/*
* First Available Server load balancing algorithm.
*
* This file implements an algorithm which emerged during a discussion with
* Steen Larsen, initially inspired from Anshul Gandhi et.al.'s work now
* described as "packing" in section 3.5:
*
* http://reports-archive.adm.cs.cmu.edu/anon/2012/CMU-CS-12-109.pdf
*
* Copyright 2000-2012 Willy Tarreau <w@1wt.eu>
*
* This program is free software; you can redistribute it and/or