commit ad1bd6a2865dd168dbb8e58c0c356516dd1af6ad
parent 7f160e8da228f6149dc0ae95b8f4c9fed94d003e
Author: Christian Grothoff <christian@grothoff.org>
Date: Sun, 14 Jul 2024 20:36:29 +0200
-fix formulation
Diffstat:
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -939,14 +939,14 @@ Connectivity | |Underlay| |Underlay| | Underlay | ...
peer, and thus miss out on quality routing table entries. This
would degrade the performance of the DHT and <bcp14>SHOULD</bcp14>
thus be avoided by advertising updated <tt>HELLOs</tt> before the
- previous one expires. When using unreliable underlays, the application
- <bcp14>MAY</bcp14> want to use an even higher frequency and transmit
- more <tt>HelloMessages</tt> within an expiration interval
+ previous one expires. When using unreliable underlays, an implementation
+ <bcp14>MAY</bcp14> use an even higher frequency and transmit
+ more <tt>HelloMessages</tt> within an expiration interval
to ensure that neighbours almost always have non-expired
<tt>HelloMessages</tt> at their disposal even if some messages
are lost.
</t>
- <t>
+ <t>
Whenever a peer receives such a <tt>HelloMessage</tt>
from another peer that is already in the routing
table, it must cache it as long as that peer remains in its
@@ -968,7 +968,7 @@ Connectivity | |Underlay| |Underlay| | Underlay | ...
filter is part of the routing metadata in messages to
prevent circular routes. It is updated at each hop where the
hop's peer identity derived from the peer's public key is
- added to it.
+ added to it.
The peer Bloom filter follows the definition in <xref target="bloom_filters"/>.
It <bcp14>MUST</bcp14> be <tt>L=1024</tt> bits
(128 bytes) in size and <bcp14>MUST</bcp14> set <tt>k=16</tt> bits per
