summaryrefslogtreecommitdiff
path: root/draft-schanzen-r5n.xml
diff options
context:
space:
mode:
Diffstat (limited to 'draft-schanzen-r5n.xml')
-rw-r--r--draft-schanzen-r5n.xml14
1 files changed, 11 insertions, 3 deletions
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
index 3c75039..b1e3740 100644
--- a/draft-schanzen-r5n.xml
+++ b/draft-schanzen-r5n.xml
@@ -1127,9 +1127,17 @@ BEGIN
1127 store entries for the last <tt>MAX_RECENT</tt> requests 1127 store entries for the last <tt>MAX_RECENT</tt> requests
1128 the peer has encountered. To ensure that the peer does 1128 the peer has encountered. To ensure that the peer does
1129 not run out of memory, information about older requests 1129 not run out of memory, information about older requests
1130 is discarded. The value of <tt>MAX_RECENT</tt> <bcp14>MAY</bcp14> be 1130 is discarded.
1131 configurable and <bcp14>SHOULD</bcp14> be at least 128 * 10<sup>3</sup>. 1131 The value of <tt>MAX_RECENT</tt> <bcp14>MAY</bcp14> be configurable.
1132 </t> 1132 <tt>MAX_RECENT</tt> <bcp14>SHOULD</bcp14>
1133 be at least 128 * 10<sup>3</sup>.
1134 If the pending table is smaller, the likelihood grows that a peer
1135 receives a response to a query but is unable to forward it to the
1136 initiator because it forgot the predecessor. Eventually, the
1137 initiator would likely succeed by repeating the query.
1138 However, this would be much more expensive than peers having an adequately
1139 sized pending table.
1140 </t>
1133 <t> 1141 <t>
1134 For each entry in the pending table, the DHT 1142 For each entry in the pending table, the DHT
1135 <bcp14>MUST</bcp14> track the query key, the peer identity 1143 <bcp14>MUST</bcp14> track the query key, the peer identity