<title>Pending Request Counting Algorithm</title>
<p>Enabled via <code>lbmethod=bybusyness</code>, this scheduler keeps
- track of how many requests each worker is assigned at present. A new
+ track of how many requests each worker is currently assigned at present. A new
request is automatically assigned to the worker with the lowest
number of active requests. This is useful in the case of workers
that queue incoming requests independently of Apache, to ensure that
queue length stays even and a request is always given to the worker
- most likely to service it fastest.</p>
+ most likely to service it the fastest and reduce latency.</p>
<p>In the case of multiple least-busy workers, the statistics (and
weightings) used by the Request Counting method are used to break the
tie. Over time, the distribution of work will come to resemble that
- characteristic of <code>byrequests</code>.</p>
+ characteristic of <code>byrequests</code> (as implemented
+ by <module>mod_lbmethod_byrequests</module>).</p>
</section>
this worker to handle</em>. This is also a normalized value
representing their "share" of the amount of work to be done,
but instead of simply counting the number of requests, we take
- into account the amount of traffic this worker has seen.</p>
+ into account the amount of traffic this worker has either seen
+ or produced.</p>
<p>If a balancer is configured as follows:</p>
size of the request and response are applied to the weighting
and selection algorithm.</p>
+ <p>Note: input and output bytes are weighted the same.</p>
+
</section>
</modulesynopsis>