F3726, F3211, F3174, R5135, R3816-HP Firewalls and UTM Devices High Availability Configuration Guide-6PW100

214
Item Remarks
Scheduler
A scheduling algorithm that a logical link group uses to distribute traffic.
Round Robin—Assigns new connections to each logical link in turn.
Weighted Round Robin—Assigns new connections to each logical link
based on the weights of logical links; a higher weight indicates more new
connections will be assigned.
Least Connections—New connections are always assigned to the logical
link with the fewest number of active connections.
Weighted Least Connections—New connections are always assigned to the
logical link with the fewest number of weighted active connections (the
number of active connections/weight).
Random—Assigns new connections to logical links randomly.
Weighted random—Assigns new connections randomly to logical links
based on their weights; a higher weight indicates more new connections will
be assigned.
Source Address Hashing—Assigns a new connection to a specific logical
link based on the source address of the connection. This algorithm makes
sure new connections with the same source address can be assigned to the
same logical link.
Source Address Port Hashing—Assigns a new connection to a specific
logical link based on the source address and source port of the connection.
This algorithm make sure new connections with the same source address
and port can be assigned to the same logical link.
Destination Address Hashing—Assigns a new connection to a specific
logical link based on the destination address of the connection. This
algorithm make sure new connections with the same destination address
can be assigned to the same logical link.
Weighted Bandwidth—Assigns new connections to each logical link based
on the product of the available bandwidth of the current physical link and
the weights of logical links. A higher product value indicates more new
connections will be assigned.
Max Bandwidth—Assigns new connections to logical links that have
greatest physical link available bandwidth.
Local Priority—Available logical links with the same priority are assigned to
a subgroup. The logical links are selected by subgroup according to the
specified minimum active logical link number, and scheduling is performed
among the selected logical links. Suppose a logical link group has two
logical links with priority 10 and three logical links with priority 5, and all
logical links are available. If the minimum active logical link number is 2,
only two logical links with priority 10 participate in scheduling. If the
minimum active logical link number is 3, the logical links with both priority
10 and 5 participate in scheduling.
Minimum Active Logical Link
Service Number
Specify the minimum number of active logical links to participate in scheduling
when you select Local Priority for Scheduler.