Enum SchedulingPolicy 

pub enum SchedulingPolicy {
    BestPath,
    RoundRobin,
    WeightedRoundRobin,
    Redundant,
    LowestLatency,
}

Strategy for selecting which path to send a packet on.

Variants

BestPath

Always use the path with the highest score (bandwidth/latency).

RoundRobin

Round-robin across all active paths.

WeightedRoundRobin

Weighted round-robin — paths with higher bandwidth get more packets.

Redundant

Redundant — send every packet on ALL active paths simultaneously. Highest reliability, highest bandwidth usage.

LowestLatency

Lowest latency — always pick the path with smallest latency_ms.

Trait Implementations

impl Clone for SchedulingPolicy

fn clone(&self) -> SchedulingPolicy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SchedulingPolicy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for SchedulingPolicy

fn eq(&self, other: &SchedulingPolicy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for SchedulingPolicy