commit 851321a518e91147e8727b1981a3058b2e6be1be
parent dd605ce6656610554367258541e6aa2201a9dbff
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Wed, 13 Sep 2023 17:21:50 +0200
update more r5n
Diffstat:
2 files changed, 24 insertions(+), 2 deletions(-)
diff --git a/.gitignore b/.gitignore
@@ -0,0 +1,8 @@
+*.aux
+*.log
+*.toc
+*.out
+*.snm
+*.pdf
+*.nav
+.DS_Store
diff --git a/IETF118/r5n.tex b/IETF118/r5n.tex
@@ -28,13 +28,27 @@
\end{itemize}
\end{frame}
+
+\begin{frame}{Support for restricted-route environments}
+ From ``R5N : Randomized Recursive Routing for
+Restricted-Route Networks'' by Evans et al.:
+ \begin{itemize}
+ \item ``Restricted-route topology'' refers to a connected underlay topology which prohibits (restricts) direct
+connections between some of the nodes.
+ \item Common DHT routing algorithms show diminished performance or even arrant failure when operating over a restricted-route underlay.
+ \item A common solution is to restrict participation in the DHT to peers that are not encumbered by NAT or firewalls.
+ \item However, this solution limits load-distribution for P2P applications and does not work at all for
+ physical networks or friend-to-friend networks.
+ \item For these types of networks, some other method of routing must be employed to cope with restrictions on direct communication.
+ \end{itemize}
+\end{frame}
+
\begin{frame}{Support for in restricted-route environments}
\begin{itemize}
- \item Problem: Restricted routes: what is that?
\item Some peers, which from the distance metric (XOR) may be close, may not be reachable (e.g. firewall).
\item This leads to multiple (local) minima wrt where data may be stored/can be retrieved.
\item Solution: Randomized routing before XOR-metric-based routing. "Escape" local minimum sink.
- \item When we have a small world topolofy, such a random walk will cause us to land in a random spot in the network and we will find a random local minimum.
+ \item When we have a small world topology, such a random walk will cause us to land in a random spot in the network and we will find a random local minimum.
\end{itemize}
\end{frame}
