Red Hat ENTERPRISE LINUX AS 2.1 Installation Manual page 106

106
Distributes each request sequentially around the pool of real servers. Using this algorithm, all
the real servers are treated as equals without regard to capacity or load. This scheduling model
resembles round-robin DNS but is more granular due to the fact that it is network-connection
based and not host-based. LVS round-robin scheduling also does not suffer the imbalances
caused by cached DNS queries.
Weighted Round-Robin Scheduling
Distributes each request sequentially around the pool of real servers but gives more jobs to
servers with greater capacity. Capacity is indicated by a user-assigned weight factor, which is
then adjusted upward or downward by dynamic load information. See Section 6.3.2, Server
Weight and Scheduling for more on weighting real servers.
Weighted round-robin scheduling is a better choice if there are significant differences in the
capacity of certain real servers in the pool. However, if the request load varies dramatically, the
more heavily weighted server may answer more than its share of requests.
Least-Connection
Distributes more requests to real servers with fewer active connections. Because it keeps track of
live connections to the real servers through the IPVS table, least-connection is a type of dynamic
scheduling algorithm, making it a better choice if there is a high degree of variation in the request
load. It is best suited for a real server pool where each member node has roughly the same
capacity. If a group of servers have different capabilities, weighted least-connection scheduling
is a better choice.
Weighted Least-Connections (default)
Distributes more requests to servers with fewer active connections relative to their capacities.
Capacity is indicated by a user-assigned weight, which is then adjusted upward or downward
by dynamic load information. The addition of weighting makes this algorithm ideal when the
real server pool contains hardware of varying capacity. See Section 6.3.2, Server Weight and
Scheduling for more on weighting real servers.
Locality-Based Least-Connection Scheduling
Distributes more requests to servers with fewer active connections relative to their destination
IPs. This algorithm is designed for use in a proxy-cache server cluster. It routes the packets
for an IP address to the server for that address unless that server is above its capacity and has a
server in its half load, in which case it will assign the least loaded real server to the IP address.
Locality-Based Least-Connection Scheduling with Replication Scheduling (R)
Distributes more requests to servers with fewer active connections relative to their destination
IPs. This algorithm is also designed for use in a proxy-cache server cluster. It differs from
Locality-Based Least-Connection Scheduling by mapping the target IP address to a subset of
real server nodes. Requests are then routed to the server in this subset with the lowest number
Chapter 6:Linux Virtual Server Overview