Struct SemanticRoutingTable 

pub struct SemanticRoutingTable { /* private fields */ }

Routing table for semantic DHT

Implementations

impl SemanticRoutingTable

pub fn new(config: SemanticDHTConfig) -> Self

Create a new semantic routing table

pub fn update_local_embedding(&self, embedding: Vec<f32>) -> Result<()>

Update local peer’s embedding based on stored data

pub fn add_peer(&self, peer: SemanticPeer) -> Result<()>

Add or update a peer in the routing table

pub fn remove_peer(&self, peer_id: &PeerId)

Remove a peer from the routing table

pub fn find_nearest_peers( &self, embedding: &[f32], k: usize, ) -> Vec<(PeerId, f32)>

Find k nearest peers to a given embedding (greedy routing)

pub fn find_nearest_peers_balanced( &self, embedding: &[f32], k: usize, ) -> Vec<(PeerId, f32)>

Find k nearest peers with load balancing consideration

pub fn get_cluster_peers(&self, cluster_id: usize) -> Vec<PeerId>

Get peers in a specific cluster

pub fn num_peers(&self) -> usize

Get number of peers

pub fn num_clusters(&self) -> usize

Get number of clusters

pub fn get_cached_route(&self, embedding: &[f32]) -> Option<Vec<PeerId>>

Check route cache for cached routing decision

pub fn cache_route(&self, embedding: &[f32], peers: Vec<PeerId>)

Cache a routing decision for future queries

pub fn clear_route_cache(&self)

Clear the route cache (useful when network topology changes significantly)

pub fn route_cache_stats(&self) -> (usize, usize)

Get route cache statistics

pub fn update_clusters(&self, num_clusters: usize) -> Result<()>

Update peer clusters using k-means clustering

Trait Implementations

impl Debug for SemanticRoutingTable

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

Formats the value using the given formatter.