Struct RoutingTableManager 

pub struct RoutingTableManager {
    pub buckets: Vec<KBucket>,
    pub local_id: NodeId,
    pub k: usize,
    pub alpha: usize,
}

Kademlia-style XOR-metric routing table manager.

Manages 256 k-buckets (one per bit of the 256-bit node-ID space). Bucket i holds nodes whose XOR distance to the local node starts with exactly i leading zero bits.

Parameters

• k — maximum number of active entries per bucket (default: 20).
• alpha — concurrency factor for parallel lookups (default: 3; stored but not used internally — callers read it when launching lookups).

Fields

buckets: Vec<KBucket>

The 256 k-buckets.

local_id: NodeId

This node’s own identifier.

k: usize

Maximum entries per bucket.

alpha: usize

Lookup concurrency parameter.

Implementations

impl RoutingTableManager

pub fn new(local_id: NodeId, k: usize, alpha: usize) -> Self

Create a new routing table manager.

Arguments

• local_id — this node’s 256-bit identifier.
• k — k-bucket size (use DEFAULT_K for the standard Kademlia value).
• alpha — concurrency factor (use DEFAULT_ALPHA for the standard value).

pub fn with_defaults(local_id: NodeId) -> Self

Create a routing table manager with default parameters (k=20, alpha=3).

pub fn add_node( &mut self, node_id: NodeId, address: String, rtt_ms: u64, now: u64, )

Insert or refresh a node in the routing table.

• If the node already appears in its bucket → LRU update (move to tail).
• If the bucket is not full → append.
• If the bucket is full → put into the replacement cache.

Silently ignores attempts to add the local node itself.

pub fn remove_node(&mut self, node_id: &NodeId) -> bool

Remove a node from the routing table.

If the node was in a bucket’s active list a replacement from the cache is promoted automatically.

Returns true if the node was found in an active bucket.

pub fn mark_failed(&mut self, node_id: &NodeId, now: u64)

Record a failed query for a node.

After MAX_FAILED_QUERIES (3) consecutive failures the node is evicted and a replacement is promoted from the cache.

pub fn update_rtt(&mut self, node_id: &NodeId, rtt_ms: u64, now: u64)

Update the RTT observation and last-seen timestamp for a node.

pub fn find_closest(&self, target: &NodeId, count: usize) -> Vec<BucketEntry>

Return up to count entries closest to target measured by XOR distance.

The result is sorted ascending by XOR distance (closest first).

pub fn bucket_sizes(&self) -> Vec<usize>

Return the number of active entries in each of the 256 buckets.

pub fn total_nodes(&self) -> usize

Return the total number of active entries across all buckets.

pub fn stats(&self) -> RoutingTableStats

Compute aggregate statistics for the routing table.

pub fn bucket_index_for(&self, target: &NodeId) -> usize

Return the k-bucket index for a given target node ID.

pub fn iter_entries(&self) -> impl Iterator<Item = &BucketEntry>

Iterate over all active BucketEntry records.

pub fn is_empty(&self) -> bool

Return true if the routing table contains no active entries.