commit 94a71022d5e4c9b419bd9fc2c49fbfbe26350dfd
parent 02703129e74f043311095a3bce2472de202aabf4
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Mon, 30 Oct 2023 10:36:09 +0900
minor editorial
Diffstat:
1 file changed, 8 insertions(+), 7 deletions(-)
diff --git a/IETF118/r5n.tex b/IETF118/r5n.tex
@@ -8,7 +8,7 @@
\usepackage{blkarray}
\usepackage{amsmath}
\usepackage{multirow}
-\title{The R5N Distributed Hash Table\\\small{IETF118}}
+\title{The $R^5N$ Distributed Hash Table\\\small{IETF118}}
\date{06/11/2023}
\author{\textbf{Martin Schanzenbach~$\spadesuit$}, Christian Grothoff~$\clubsuit$, Bernd Fix~$\diamondsuit$}
%\institute{\hfill\includegraphics[trim={0cm 1.5cm 0cm 0cm},clip,width=6em]{gnunet}\url{https://gnunet.org}}
@@ -19,24 +19,25 @@
% \section{The R5N DHT In a Nutshell}
-\begin{frame}{The R5N DHT I-D}
- \url{https://datatracker.ietf.org/doc/draft-schanzen-r5n/}\\R5N is a DHT with the following distinguishing properties:
+\begin{frame}{$R^5N$: Randomized-recursive routing for restricted-route networks}
+ $R^5N$ is a DHT with the following design goals:
\begin{itemize}
\item \textbf{Open participation peer-to-peer routing}.
\item Works in \textbf{restricted-route environments}.
\item Supports \textbf{route path recording}.
\item In-band \textbf{request (and response) validation}.
- \item \textbf{Result filtering}.
+ \item Allows for \textbf{result filtering}.
\end{itemize}
+ I-D: \url{https://datatracker.ietf.org/doc/draft-schanzen-r5n/}
\end{frame}
\begin{frame}{Open participation peer-to-peer routing}
\begin{itemize}
\item Access control requires authentication (and trust) and leads to centralization.
- \item RELOAD (RFC 6940): ``RELOAD's security model is based on each node having one or more
+ \item RELOAD (RFC 6940): ``\textit{RELOAD's security model is based on each node having one or more
public key certificates. In general, these certificates will be
assigned by a central server, which also assigns Node-IDs, although
- self-signed certificates can be used in closed networks.''
+ self-signed certificates can be used in closed networks.}''
\item (Popular) DHTs today require classic Kademlia-style ad-hoc permissionless participation (e.g. IPFS).
\end{itemize}
\end{frame}
@@ -46,7 +47,7 @@
From ``$R^5N$ : Randomized Recursive Routing for
Restricted-Route Networks'' by Evans et al.:
\begin{itemize}
- \item ``Restricted-route topology'' refers to a connected underlay topology which does not support direct
+ \item \textit{Restricted-route topology} refers to a connected underlay topology which does not support direct
connections between some of the nodes (e.g. wireless mesh networks, NAT or firewalls).
\item Common DHT routing algorithms (e.g. Kademlia) show diminished performance or even arrant failure when operating over a restricted-route underlay.
\item A common solution is to prevent participation in the DHT to peers that are not encumbered by such restrictions.
