| Description: | Request Counting load balancer scheduler algorithm formod_proxy_balancer |
|---|---|
| Status: | Extension |
| Module Identifier: | lbmethod_byrequests_module |
| Source File: | mod_lbmethod_byrequests.c |
| Compatibility: | Split off frommod_proxy_balancer in 2.3 |
This module does not provide any configuration directives of its own.It requires the services ofmod_proxy_balancer, andprovides thebyrequests load balancing method.
Enabled vialbmethod=byrequests, the idea behind this scheduler is that we distribute the requests among the various workers to ensure that each gets their configured share of the number of requests. It works as follows:
lbfactor ishow much we expect this worker to work, orthe workers' work quota. This is a normalized value representing their "share" of the amount of work to be done.
lbstatus ishow urgent this worker has to work to fulfill its quota of work.
Theworker is a member of the load balancer, usually a remote host serving one of the supported protocols.
We distribute each worker's work quota to the worker, and then look which of them needs to work most urgently (biggest lbstatus). This worker is then selected for work, and its lbstatus reduced by the total work quota we distributed to all workers. Thus the sum of all lbstatus does not change(*) and we distribute the requests as desired.
If some workers are disabled, the others will still be scheduled correctly.
for each worker in workers worker lbstatus += worker lbfactor total factor += worker lbfactor if worker lbstatus > candidate lbstatus candidate = workercandidate lbstatus -= total factorIf a balancer is configured as follows:
| worker | a | b | c | d |
|---|---|---|---|---|
| lbfactor | 25 | 25 | 25 | 25 |
| lbstatus | 0 | 0 | 0 | 0 |
Andb gets disabled, the following schedule is produced:
| worker | a | b | c | d |
|---|---|---|---|---|
| lbstatus | -50 | 0 | 25 | 25 |
| lbstatus | -25 | 0 | -25 | 50 |
| lbstatus | 0 | 0 | 0 | 0 |
| (repeat) | ||||
That is it schedules:acdacdacd ... Please note that:
| worker | a | b | c | d |
|---|---|---|---|---|
| lbfactor | 25 | 25 | 25 | 25 |
Has the exact same behavior as:
| worker | a | b | c | d |
|---|---|---|---|---|
| lbfactor | 1 | 1 | 1 | 1 |
This is because all values oflbfactor are normalized with respect to the others. For:
| worker | a | b | c |
|---|---|---|---|
| lbfactor | 1 | 4 | 1 |
workerb will, on average, get 4 times the requests thata andc will.
The following asymmetric configuration works as one would expect:
| worker | a | b |
|---|---|---|
| lbfactor | 70 | 30 |
| lbstatus | -30 | 30 |
| lbstatus | 40 | -40 |
| lbstatus | 10 | -10 |
| lbstatus | -20 | 20 |
| lbstatus | -50 | 50 |
| lbstatus | 20 | -20 |
| lbstatus | -10 | 10 |
| lbstatus | -40 | 40 |
| lbstatus | 30 | -30 |
| lbstatus | 0 | 0 |
| (repeat) | ||
That is after 10 schedules, the schedule repeats and 7a are selected with 3b interspersed.
Copyright 2025 The Apache Software Foundation.
Licensed under theApache License, Version 2.0.