Link Aggregation (LAG)
Define the member links and their speed and I compute the aggregate bandwidth, the per-flow ceiling (one flow never exceeds one link) and the hash balancing, warning if the split is uneven.
Hash load-balancing
—
Buckets per member
—
How it is computed · aggregate, flow and buckets
1. Aggregate bandwidth
= N × speed. It is the theoretical ceiling: the
sum of all active members.
2. Per-flow ceiling = 1 link.
The hash maps each flow (same source/destination pair) to one
member, so a single flow never exceeds one link's speed.
3. Hash buckets: a power of 2
(typ. 8). They are split across the N
members: base = ⌊buckets / N⌋ with
buckets mod N leftover buckets going to the first members.
4. If N is not a power of 2 it
does not divide the buckets and the split is
uneven (e.g. 3 members with 8 buckets →
3/3/2): some members carry more traffic than others.
Runs locally in your browser · no sign-up · nothing leaves your browser