Least loaded strategy

Example

How Least loaded decides — the pool is evaluated and the winner is assigned. Each strategy selects differently.

▸ Show the code

route.go

// Least loaded selects from the pool and assigns.
engine.Route(ductor.Route{
    Match:    `routable.type == "lead"`,
    Strategy: "least_loaded",
    Pool:     "sales-team",
})
 
// Durable, observable, exactly-once.
decision, err := engine.Dispatch(ctx, routable)

How it works

Selects the recipient with the lowest current load. Best when you have accurate, low-latency load signals and want to pack work onto the freest workers.

Stateful

More Balance & distribution

Smooth weighted round-robinShipped

Drift-free weighted rotation that spreads load proportionally to weight.

Random weightedShipped

Weighted random pick — simple probabilistic distribution by weight.

Power of two choicesShipped

Sample two candidates, pick the less loaded. Near-optimal and O(1).

Consistent hashShipped

Sticky routing — the same key always lands on the same recipient.

FailoverShipped

Active-passive HA — promote the next tier when the active recipient is unhealthy.

Fair catch-upShipped

Boosts under-assigned recipients to repay fairness debt over a window.