Struct AdaptiveRoutingEngine 

pub struct AdaptiveRoutingEngine { /* private fields */ }

An adaptive, multi-path routing engine for IPFRS network nodes.

Maintains per-destination route tables with real-time metrics updated via EWMA and selects the best next-hop according to a configurable RoutingPolicy.

Implementations

impl AdaptiveRoutingEngine

pub fn new(config: AdaptiveRoutingConfig) -> Self

Create a new engine with the supplied configuration.

pub fn with_defaults() -> Self

Create an engine with default configuration.

pub fn add_route(&mut self, key: RouteKey, entry: RouteEntry)

Add or overwrite a route entry for the given key.

If max_routes_per_key is reached the entry with the worst score is replaced.

pub fn remove_route(&mut self, key: &RouteKey, next_hop: &[u8; 32])

Remove all routes for the given key that use next_hop.

pub fn clear_routes(&mut self, key: &RouteKey)

Remove every route entry associated with key.

pub fn routes_for(&self, key: &RouteKey) -> Option<&[RouteEntry]>

Return an immutable slice of route entries for a key, if any.

pub fn update_metrics( &mut self, key: &RouteKey, next_hop: &[u8; 32], rtt_ms: f64, loss: f64, ) -> Result<(), RoutingEngineError>

Apply an EWMA update to RTT and loss metrics for a specific next-hop.

Errors

Returns Err if the key or next-hop is not found in the route table.

pub fn update_bandwidth( &mut self, key: &RouteKey, next_hop: &[u8; 32], bandwidth_kbps: f64, ) -> Result<(), RoutingEngineError>

Update only the bandwidth estimate for a specific next-hop.

pub fn select_next_hop( &self, key: &RouteKey, policy: RoutingPolicy, ) -> Option<[u8; 32]>

Select the best next-hop peer for key according to policy.

Returns None if no routes are recorded for the key or all entries are unhealthy.

pub fn select_next_hop_default(&self, key: &RouteKey) -> Option<[u8; 32]>

Select using the engine’s current active policy.

pub fn set_policy(&mut self, policy: RoutingPolicy)

Switch the active routing policy, incrementing the policy-switch counter.

pub fn active_policy(&self) -> RoutingPolicy

Return the currently active routing policy.

pub fn probe_routes(&mut self)

Simulate a probe round: apply synthetic RTT perturbations to all routes using xorshift64-based PRNG.

In production this would send real probe packets; here we perturb existing RTT estimates to model jitter and update weights accordingly.

pub fn run_adaptation_cycle(&mut self)

Prune stale route entries and recompute all weights.

An entry is considered stale if it hasn’t been updated for more than probe_interval_secs × 3 seconds.

pub fn routing_stats(&self) -> AdaptiveRoutingStats

Return a snapshot of current engine statistics.

pub fn key_count(&self) -> usize

Return the number of unique RouteKeys tracked.

pub fn entry_count(&self) -> usize

Return the total number of route entries across all keys.

pub fn has_route(&self, key: &RouteKey, next_hop: &[u8; 32]) -> bool

Check whether a route exists for the given key and next-hop.

pub fn next_hops_for(&self, key: &RouteKey) -> Vec<[u8; 32]>

Return all distinct next-hops recorded for key.

pub fn best_entry( &self, key: &RouteKey, policy: RoutingPolicy, ) -> Option<RouteEntry>

Return the best route entry for key under the given policy (clone).

pub fn route_table(&self) -> &HashMap<RouteKey, Vec<RouteEntry>>

Return a reference to the underlying route table.

pub fn merge_from(&mut self, other: &AdaptiveRoutingEngine)

Merge another engine’s route table into this one.

pub fn resize_max_routes(&mut self, new_max: usize)

Resize max_routes_per_key and evict excess entries if needed.

pub fn set_alpha(&mut self, alpha: f64) -> Result<(), RoutingEngineError>

Update the EWMA alpha factor.

Errors

Returns Err if alpha is outside (0.0, 1.0].

pub fn set_probe_interval(&mut self, secs: u64)

Update the probe interval.

pub fn reset(&mut self)

Drain all routes and reset statistics.