lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit b3a4e43da5328292e6a6acb35d3b5d5f8623aba7
parent 3e58a5b4aa9eaffac3f1b7d67ae9b1f5e42c5003
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date:   Wed, 29 Dec 2021 19:58:20 +0100

routing

Diffstat:
Mdraft-schanzen-r5n.xml | 12++++++++++++
1 file changed, 12 insertions(+), 0 deletions(-)

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -539,6 +539,18 @@ END FIXME: Also has a bloomfilter. Isn't AmClosestNode simply !SelectClosestPeer == myID ? </dd> + <dt><tt>SelectRandomPeer() -> NodeID</tt></dt> + <dd> + This procedure selects a random node ID from all connected + nodes. FIXME find elegant way to handle bloomfilter + </dd> + <dt><tt>SelectPeer(Key, NumberOfHops)</tt></dt> + <dd> + This procedure selects a peer depending on the <tt>NumberOfHops</tt> + Parameter. If <tt>NumberOfHops &lt; NETWORK_SIZE_ESTIMATE</tt> + this procedure returns <tt>SelectRandomPeer()</tt> and + <tt>SelectClosestPeer(Key)</tt> otherwise. + </dd> <dt><tt>AmClosestNode(NodeID, Key, Bloom) -> true | false</tt></dt> <dd> This procedure first determines which k-bucket contains the