Struct PeerLatencyTracker 

pub struct PeerLatencyTracker { /* private fields */ }

Tracks per-peer latency with sliding windows and enables peer ranking.

This is complementary to AdaptiveLookupScheduler: the scheduler decides how many concurrent requests to send, while PeerLatencyTracker decides which peers to prefer.

Implementations

impl PeerLatencyTracker

pub fn new() -> Self

Create an empty tracker.

pub fn record(&mut self, peer_id: &str, latency: Duration)

Record a latency sample for peer_id.

pub fn p90_for_peer(&self, peer_id: &str) -> Option<Duration>

Return the p90 latency for a specific peer, or None if unknown.

pub fn fastest_peers(&self, n: usize) -> Vec<String>

Return the n peer IDs with the lowest median latency.

Peers with no recorded samples are excluded. If fewer than n peers have samples, all qualifying peers are returned.

pub fn prune_stale(&mut self, max_age: Duration)

Remove peers whose most recent sample is older than max_age.

pub fn peer_count(&self) -> usize

Number of peers currently tracked.

Trait Implementations

impl Debug for PeerLatencyTracker

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

Formats the value using the given formatter.

impl Default for PeerLatencyTracker

fn default() -> Self

Returns the “default value” for a type.