Enum RoutingPolicy 

pub enum RoutingPolicy {
    ShortestPath,
    LowestLatency,
    HighestBandwidth,
    LoadBalanced,
    QoSAware,
}

Policy governing how the best next-hop is selected from candidate routes.

Variants

ShortestPath

Minimize hop count (use pre-computed weight).

LowestLatency

Prefer routes with the lowest RTT.

HighestBandwidth

Prefer routes with the highest estimated bandwidth.

LoadBalanced

Distribute traffic across routes proportional to their weights.

QoSAware

Consider both latency and loss rate (QoS composite score).

Implementations

impl RoutingPolicy

pub fn label(&self) -> &'static str

Return a human-readable label for the policy.

Trait Implementations

impl Clone for RoutingPolicy

fn clone(&self) -> RoutingPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RoutingPolicy

impl Debug for RoutingPolicy

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

Formats the value using the given formatter.

impl Default for RoutingPolicy

fn default() -> RoutingPolicy

Returns the “default value” for a type.

impl Eq for RoutingPolicy

impl Hash for RoutingPolicy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RoutingPolicy

fn eq(&self, other: &RoutingPolicy) -> 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 RoutingPolicy