review intro

1 files changed, 14 insertions, 0 deletions

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
index a62b15e..2c25f77 100644
--- a/draft-schanzen-r5n.xml
+++ b/draft-schanzen-r5n.xml
@@ -13,6 +13,7 @@
 <!ENTITY RFC5891 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.5891.xml">
 <!ENTITY RFC6781 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6781.xml">
 <!ENTITY RFC6895 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6895.xml">
+<!ENTITY RFC6940 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6940.xml">
 <!ENTITY RFC6979 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6979.xml">
 <!ENTITY RFC7748 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7748.xml">
 <!ENTITY RFC8032 PUBLIC '' "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8032.xml">
@@ -93,9 +94,21 @@
        key-value pairs.
      </t>
      <t>
+       While <xref target="RFC6940" /> already provides a peer-to-peer (P2P)
+       signaling protocol with extensible routing and topology mechanisms,
+       it also relies on strict admission control through the use of either
+       centralized enrollment servers or pre-shared keys.
+       Modern decentralized applications require a more open system that
+       enables ad-hoc participation and other means to prevent common attacks
+       on P2P overlays.
+     </t>
+     <t>
        This document contains the technical specification
        of the R5N DHT <xref target="R5N" />, a secure DHT routing algorithm
        and data structure for decentralized applications.
+       R5N is an open P2P overlay routing mechanism which supports ad-hoc
+       participation and security properties including support for
+       topologies in restricted-route environments and path signatures.
      </t>
      <t>
        This document defines the normative wire format of peer-to-peer
@@ -719,6 +732,7 @@ Purpose | Name            | References | Description
          &RFC3629;
          &RFC3986;
          &RFC4648;
+         &RFC6940;
          &RFC8126;
  
       <reference anchor="ed25519" target="http://link.springer.com/chapter/10.1007/978-3-642-23951-9_9">