summaryrefslogtreecommitdiff
path: root/draft-schanzen-r5n.xml
diff options
context:
space:
mode:
authorMartin Schanzenbach <schanzen@gnunet.org>2022-10-25 11:24:01 +0900
committerMartin Schanzenbach <schanzen@gnunet.org>2022-10-25 11:24:01 +0900
commit3987e50a30cf23addc6aca5d409063244bcd35c7 (patch)
treef9ef3876c46d74a81d86062332ea2c42e16d37c3 /draft-schanzen-r5n.xml
parent11c84f0f9c15a65c601c627577dde5dc2df0c58f (diff)
downloadlsd0004-3987e50a30cf23addc6aca5d409063244bcd35c7.tar.gz
lsd0004-3987e50a30cf23addc6aca5d409063244bcd35c7.zip
some typos; peer filter
Diffstat (limited to 'draft-schanzen-r5n.xml')
-rw-r--r--draft-schanzen-r5n.xml16
1 files changed, 8 insertions, 8 deletions
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
index cf67d50..ac74024 100644
--- a/draft-schanzen-r5n.xml
+++ b/draft-schanzen-r5n.xml
@@ -938,7 +938,7 @@ bchar = *(ALPHA / DIGIT)
938 <tt>SelectClosestpeer(K, B)</tt> otherwise. 938 <tt>SelectClosestpeer(K, B)</tt> otherwise.
939 </dd> 939 </dd>
940 <dt> 940 <dt>
941 <tt>IsClosestpeer(N, K, B) -&gt; true | false</tt> 941 <tt>IsClosestPeer(N, K, B) -&gt; true | false</tt>
942 </dt> 942 </dt>
943 <dd> 943 <dd>
944 This function checks if <tt>N</tt> is the closest peer for <tt>K</tt> 944 This function checks if <tt>N</tt> is the closest peer for <tt>K</tt>
@@ -1611,12 +1611,12 @@ BEGIN
1611 </li> 1611 </li>
1612 <li> 1612 <li>
1613 If the local peer is the closest peer 1613 If the local peer is the closest peer
1614 (cf. <tt>IsClosestpeer(SELF, BLOCK_KEY)</tt>) or the <tt>DemultiplexEverywhere</tt> 1614 (cf. <tt>IsClosestPeer(SELF, BLOCK_KEY, PeerFilter)</tt>) or the <tt>DemultiplexEverywhere</tt>
1615 flag ist set, the message <bcp14>MUST</bcp14> 1615 flag ist set, the message <bcp14>MUST</bcp14>
1616 be stored locally in the block storage. 1616 be stored locally in the block storage.
1617 </li> 1617 </li>
1618 <li> 1618 <li>
1619 If the <tt>MTYPE</tt> of the message indicates a HELLO block, the 1619 If the <tt>BTYPE</tt> of the message indicates a HELLO block, the
1620 peer <bcp14>MUST</bcp14> be considered for the local routing 1620 peer <bcp14>MUST</bcp14> be considered for the local routing
1621 table if the respective k-bucket is not yet full. In this case, 1621 table if the respective k-bucket is not yet full. In this case,
1622 the local peer <bcp14>MUST</bcp14> try to establish a connection 1622 the local peer <bcp14>MUST</bcp14> try to establish a connection
@@ -1628,7 +1628,7 @@ BEGIN
1628 </li> 1628 </li>
1629 <li> 1629 <li>
1630 Given the value in <tt>REPL_LVL</tt>, <tt>HOPCOUNT</tt> and the 1630 Given the value in <tt>REPL_LVL</tt>, <tt>HOPCOUNT</tt> and the
1631 result of <tt>IsClosestpeer(SELF, BLOCK_KEY)</tt> the number of peers to 1631 result of <tt>IsClosestPeer(SELF, BLOCK_KEY, PeerFilter)</tt> the number of peers to
1632 forward to <bcp14>MUST</bcp14> be calculated 1632 forward to <bcp14>MUST</bcp14> be calculated
1633 using <tt>ComputeOutDegree()</tt>. 1633 using <tt>ComputeOutDegree()</tt>.
1634 The implementation <bcp14>SHOULD</bcp14> select up to this 1634 The implementation <bcp14>SHOULD</bcp14> select up to this
@@ -1763,7 +1763,7 @@ BEGIN
1763 </t> 1763 </t>
1764 <ol> 1764 <ol>
1765 <li> 1765 <li>
1766 The <tt>QUERY_KEY</tt> and <tt>XQUERY</tt> fields are validated 1766 The <tt>QUERY_HASH</tt> and <tt>XQUERY</tt> fields are validated
1767 against the requested <tt>BTYPE</tt> as defined by its respective 1767 against the requested <tt>BTYPE</tt> as defined by its respective
1768 <tt>ValidateBlockQuery</tt> procedure. 1768 <tt>ValidateBlockQuery</tt> procedure.
1769 If validation 1769 If validation
@@ -1779,7 +1779,7 @@ BEGIN
1779 <li> 1779 <li>
1780 <t> 1780 <t>
1781 If the local peer is the closest peer 1781 If the local peer is the closest peer
1782 (cf. <tt>IsClosestpeer (SELF, QueryHash)</tt>) or the 1782 (cf. <tt>IsClosestPeer (SELF, QueryHash, PeerFilter)</tt>) or the
1783 <tt>DemultiplexEverywhere</tt> flag is set, a reply 1783 <tt>DemultiplexEverywhere</tt> flag is set, a reply
1784 <bcp14>MUST</bcp14> be produced (if one is available) using the following 1784 <bcp14>MUST</bcp14> be produced (if one is available) using the following
1785 steps: 1785 steps:
@@ -2007,7 +2007,7 @@ BEGIN
2007 does not have to match the <tt>QUERY_HASH</tt>. 2007 does not have to match the <tt>QUERY_HASH</tt>.
2008 </li> 2008 </li>
2009 <li> 2009 <li>
2010 If the <tt>MTYPE</tt> of the message indicates a HELLO block, the 2010 If the <tt>BTYPE</tt> of the message indicates a HELLO block, the
2011 peer <bcp14>MUST</bcp14> be considered for the local routing 2011 peer <bcp14>MUST</bcp14> be considered for the local routing
2012 table if the respective k-bucket is not yet full. In this case, 2012 table if the respective k-bucket is not yet full. In this case,
2013 the local peer <bcp14>MUST</bcp14> try to establish a connection 2013 the local peer <bcp14>MUST</bcp14> try to establish a connection
@@ -2178,7 +2178,7 @@ BEGIN
2178 </dl> 2178 </dl>
2179 <t> 2179 <t>
2180 If the main evaluation result is <tt>FILTER_MORE</tt>, the function also returns 2180 If the main evaluation result is <tt>FILTER_MORE</tt>, the function also returns
2181 and updated result filter where the block is added to the set of 2181 an updated result filter where the block is added to the set of
2182 filtered replies. An implementation is not expected to actually differenciate 2182 filtered replies. An implementation is not expected to actually differenciate
2183 between the <tt>FILTER_DUPLICATE</tt> and <tt>FILTER_IRRELEVANT</tt> return 2183 between the <tt>FILTER_DUPLICATE</tt> and <tt>FILTER_IRRELEVANT</tt> return
2184 values: in both cases the block is ignored for this query. 2184 values: in both cases the block is ignored for this query.