1 files changed, 14 insertions, 9 deletions
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
index 817cf39..831f8d2 100644
--- a/draft-schanzen-r5n.xml
+++ b/draft-schanzen-r5n.xml
@@ -823,16 +823,21 @@ Connectivity | |Underlay|  |Underlay|  | Underlay | ...
      <section anchor="routing_table">
        <name>Routing Table</name>
        <t>
-          Whenever a <tt>PEER_CONNECTED</tt> signal is received from the underlay,
+          Whenever a <tt>PEER_CONNECTED</tt> signal is received from
-          the respective peer is considered for insertion into the routing table.
+          the underlay, the respective peer is considered for
-          The routing table consists of an array of <tt>k</tt>-buckets. Each
+          insertion into the routing table.  The routing table
+          consists of an array of <tt>k</tt>-buckets. Each
          <tt>k</tt>-bucket contains a list of <em>neighbors</em>.
-          The i-th <tt>k</tt>-bucket stores neighbors whose peer public keys are
+          The i-th <tt>k</tt>-bucket stores neighbors whose peer
-          between distance 2<sup>i</sup> and 2<sup>i+1</sup> from the local peer.
+          public keys are between XOR-distance 2<sup>i</sup> and
-          System constraints will typically force an implementation to impose some
+          2<sup>i+1</sup> from the local peer; <tt>i</tt> can be
-          upper limit on the number of <em>neighbors</em> kept per <tt>k</tt>-bucket.
+          directly computed from the two peer identities using the
-          Upon insertion, the implementation <bcp14>MUST</bcp14> call
+          <tt>GetDistance()</tt> function.  System constraints will
-          <tt>HOLD</tt> on the respective <em>neighor</em>.
+          typically force an implementation to impose some upper limit
+          on the number of <em>neighbors</em> kept per
+          <tt>k</tt>-bucket.  Upon insertion, the implementation
+          <bcp14>MUST</bcp14> call <tt>HOLD</tt> on the respective
+          <em>neighor</em>.
        </t>
        <t>
          Implementations <bcp14>SHOULD</bcp14> try to keep at least

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml index 817cf39..831f8d2 100644 --- a/draft-schanzen-r5n.xml +++ b/draft-schanzen-r5n.xml
@@ -823,16 +823,21 @@ Connectivity \| \|Underlay\| \|Underlay\| \| Underlay \| ...
823	<section anchor="routing_table">	823	<section anchor="routing_table">
824	<name>Routing Table</name>	824	<name>Routing Table</name>
825	<t>	825	<t>
826	Whenever a <tt>PEER_CONNECTED</tt> signal is received from the underlay,	826	Whenever a <tt>PEER_CONNECTED</tt> signal is received from
827	the respective peer is considered for insertion into the routing table.	827	the underlay, the respective peer is considered for
828	The routing table consists of an array of <tt>k</tt>-buckets. Each	828	insertion into the routing table. The routing table
		829	consists of an array of <tt>k</tt>-buckets. Each
829	<tt>k</tt>-bucket contains a list of <em>neighbors</em>.	830	<tt>k</tt>-bucket contains a list of <em>neighbors</em>.
830	The i-th <tt>k</tt>-bucket stores neighbors whose peer public keys are	831	The i-th <tt>k</tt>-bucket stores neighbors whose peer
831	between distance 2<sup>i</sup> and 2<sup>i+1</sup> from the local peer.	832	public keys are between XOR-distance 2<sup>i</sup> and
832	System constraints will typically force an implementation to impose some	833	2<sup>i+1</sup> from the local peer; <tt>i</tt> can be
833	upper limit on the number of <em>neighbors</em> kept per <tt>k</tt>-bucket.	834	directly computed from the two peer identities using the
834	Upon insertion, the implementation <bcp14>MUST</bcp14> call	835	<tt>GetDistance()</tt> function. System constraints will
835	<tt>HOLD</tt> on the respective <em>neighor</em>.	836	typically force an implementation to impose some upper limit
		837	on the number of <em>neighbors</em> kept per
		838	<tt>k</tt>-bucket. Upon insertion, the implementation
		839	<bcp14>MUST</bcp14> call <tt>HOLD</tt> on the respective
		840	<em>neighor</em>.
836	</t>	841	</t>
837	<t>	842	<t>
838	Implementations <bcp14>SHOULD</bcp14> try to keep at least	843	Implementations <bcp14>SHOULD</bcp14> try to keep at least