logo
pub struct Kademlia<TStore> { /* private fields */ }
Expand description

Kademlia is a NetworkBehaviour that implements the libp2p Kademlia protocol.

Implementations

Creates a new Kademlia network behaviour with a default configuration.

Get the protocol name of this kademlia instance.

Creates a new Kademlia network behaviour with the given configuration.

Gets an iterator over immutable references to all running queries.

Gets an iterator over mutable references to all running queries.

Gets an immutable reference to a running query, if it exists.

Gets a mutable reference to a running query, if it exists.

Adds a known listen address of a peer participating in the DHT to the routing table.

Explicitly adding addresses of peers serves two purposes:

  1. In order for a node to join the DHT, it must know about at least one other node of the DHT.

  2. When a remote peer initiates a connection and that peer is not yet in the routing table, the Kademlia behaviour must be informed of an address on which that peer is listening for connections before it can be added to the routing table from where it can subsequently be discovered by all peers in the DHT.

If the routing table has been updated as a result of this operation, a KademliaEvent::RoutingUpdated event is emitted.

Removes an address of a peer from the routing table.

If the given address is the last address of the peer in the routing table, the peer is removed from the routing table and Some is returned with a view of the removed entry. The same applies if the peer is currently pending insertion into the routing table.

If the given peer or address is not in the routing table, this is a no-op.

Removes a peer from the routing table.

Returns None if the peer was not in the routing table, not even pending insertion.

Returns an iterator over all non-empty buckets in the routing table.

Returns the k-bucket for the distance to the given key.

Returns None if the given key refers to the local key.

Initiates an iterative query for the closest peers to the given key.

The result of the query is delivered in a [KademliaEvent::QueryResult{QueryResult::GetClosestPeers}].

Performs a lookup for a record in the DHT.

The result of this operation is delivered in a [KademliaEvent::QueryResult{QueryResult::GetRecord}].

Stores a record in the DHT.

Returns Ok if a record has been stored locally, providing the QueryId of the initial query that replicates the record in the DHT. The result of the query is eventually reported as a [KademliaEvent::QueryResult{QueryResult::PutRecord}].

The record is always stored locally with the given expiration. If the record’s expiration is None, the common case, it does not expire in local storage but is still replicated with the configured record TTL. To remove the record locally and stop it from being re-published in the DHT, see Kademlia::remove_record.

After the initial publication of the record, it is subject to (re-)replication and (re-)publication as per the configured intervals. Periodic (re-)publication does not update the record’s expiration in local storage, thus a given record with an explicit expiration will always expire at that instant and until then is subject to regular (re-)replication and (re-)publication.

Removes the record with the given key from local storage, if the local node is the publisher of the record.

Has no effect if a record for the given key is stored locally but the local node is not a publisher of the record.

This is a local operation. However, it also has the effect that the record will no longer be periodically re-published, allowing the record to eventually expire throughout the DHT.

Gets a mutable reference to the record store.

Bootstraps the local node to join the DHT.

Bootstrapping is a multi-step operation that starts with a lookup of the local node’s own ID in the DHT. This introduces the local node to the other nodes in the DHT and populates its routing table with the closest neighbours.

Subsequently, all buckets farther from the bucket of the closest neighbour are refreshed by initiating an additional bootstrapping query for each such bucket with random keys.

Returns Ok if bootstrapping has been initiated with a self-lookup, providing the QueryId for the entire bootstrapping process. The progress of bootstrapping is reported via [KademliaEvent::QueryResult{QueryResult::Bootstrap}] events, with one such event per bootstrapping query.

Returns Err if bootstrapping is impossible due an empty routing table.

Note: Bootstrapping requires at least one node of the DHT to be known. See Kademlia::add_address.

Establishes the local node as a provider of a value for the given key.

This operation publishes a provider record with the given key and identity of the local node to the peers closest to the key, thus establishing the local node as a provider.

Returns Ok if a provider record has been stored locally, providing the QueryId of the initial query that announces the local node as a provider.

The publication of the provider records is periodically repeated as per the configured interval, to renew the expiry and account for changes to the DHT topology. A provider record may be removed from local storage and thus no longer re-published by calling Kademlia::stop_providing.

In contrast to the standard Kademlia push-based model for content distribution implemented by Kademlia::put_record, the provider API implements a pull-based model that may be used in addition or as an alternative. The means by which the actual value is obtained from a provider is out of scope of the libp2p Kademlia provider API.

The results of the (repeated) provider announcements sent by this node are reported via [KademliaEvent::QueryResult{QueryResult::StartProviding}].

Stops the local node from announcing that it is a provider for the given key.

This is a local operation. The local node will still be considered as a provider for the key by other nodes until these provider records expire.

Performs a lookup for providers of a value to the given key.

The result of this operation is delivered in a reported via [KademliaEvent::QueryResult{QueryResult::GetProviders}].

Trait Implementations

Handler for all the protocols the network behaviour supports.

Event generated by the NetworkBehaviour and that the swarm will report back.

Creates a new ProtocolsHandler for a connection with a peer. Read more

Addresses that this behaviour is aware of for this specific peer, and that may allow reaching the peer. Read more

Informs the behaviour about a newly established connection to a peer.

Indicates the behaviour that we connected to the node with the given peer id. Read more

Informs the behaviour that the ConnectedPoint of an existing connection has changed.

Indicates to the behaviour that we tried to reach an address, but failed. Read more

Indicates to the behaviour that we tried to dial all the addresses known for a node, but failed. Read more

Indicates the behaviour that we disconnected from the node with the given peer id. Read more

Informs the behaviour about an event generated by the handler dedicated to the peer identified by peer_id. for the behaviour. Read more

Indicates to the behaviour that we have started listening on a new multiaddr.

Indicates to the behaviour that a new multiaddr we were listening on has expired, which means that we are no longer listening in it. Read more

Indicates to the behaviour that we have discovered a new external address for us.

Polls for things that swarm should do. Read more

Informs the behaviour about a closed connection to a peer. Read more

A listener experienced an error.

A listener closed.

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.