lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit efe55b33ab4451db75208f812973be3c025d049b
parent 696c84f74ae45b3ca89e3249c70fbeca9bd220b9
Author: Christian Grothoff <christian@grothoff.org>
Date:   Fri, 12 Jul 2024 09:28:17 +0200

style fixes

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

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -781,7 +781,7 @@ Connectivity | |Underlay| |Underlay| | Underlay | ... respective <tt>k</tt>-bucket in the routing table is full or if meta-data is present that indicates that the peer does not wish to participate in routing. - Peers added to the routing table <tt>SHOULD</tt> be signalled to the + Peers added to the routing table <bcp14>SHOULD</bcp14> be signalled to the underlay as important connections using a <tt>HOLD</tt> call. Similarly when a disconnect is indicated by the underlay through a <tt>PEER_DISCONNECTED</tt> signal, the peer @@ -806,7 +806,7 @@ Connectivity | |Underlay| |Underlay| | Underlay | ... In order to select peers which are suitable destinations for routing messages, R<sup>5</sup>N uses a hybrid approach: Given an estimated network size <tt>L2NSE</tt> retrieved using - <tt>ESTIMATE_NETWORK_SIZE ()</tt>, the peer selection for the + <tt>ESTIMATE_NETWORK_SIZE()</tt>, the peer selection for the first <tt>L2NSE</tt> hops is random. After the initial <tt>L2NSE</tt> hops, peer selection follows an XOR-based peer distance calculation.