commit 7ddd7d5bc134128abd39a397db8c819b4a22d9b4
parent 63aaa3bdea90fbfd33f752319b1296a7f0fb12ed
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Sun, 14 Jul 2024 18:35:11 +0200
bcp fix
Diffstat:
1 file changed, 11 insertions(+), 3 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -1127,9 +1127,17 @@ BEGIN
store entries for the last <tt>MAX_RECENT</tt> requests
the peer has encountered. To ensure that the peer does
not run out of memory, information about older requests
- is discarded. The value of <tt>MAX_RECENT</tt> <bcp14>MAY</bcp14> be
- configurable and <bcp14>SHOULD</bcp14> be at least 128 * 10<sup>3</sup>.
- </t>
+ is discarded.
+ The value of <tt>MAX_RECENT</tt> <bcp14>MAY</bcp14> be configurable.
+ <tt>MAX_RECENT</tt> <bcp14>SHOULD</bcp14>
+ be at least 128 * 10<sup>3</sup>.
+ If the pending table is smaller, the likelihood grows that a peer
+ receives a response to a query but is unable to forward it to the
+ initiator because it forgot the predecessor. Eventually, the
+ initiator would likely succeed by repeating the query.
+ However, this would be much more expensive than peers having an adequately
+ sized pending table.
+ </t>
<t>
For each entry in the pending table, the DHT
<bcp14>MUST</bcp14> track the query key, the peer identity
