[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] fig placement
Update of /home/freehaven/cvsroot/doc/routing-zones
In directory moria.mit.edu:/tmp/cvs-serv2718
Modified Files:
routing-zones.tex
Log Message:
fig placement
Index: routing-zones.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.tex,v
retrieving revision 1.55
retrieving revision 1.56
diff -u -d -r1.55 -r1.56
--- routing-zones.tex 29 Jan 2004 05:28:59 -0000 1.55
+++ routing-zones.tex 29 Jan 2004 05:35:13 -0000 1.56
@@ -704,25 +704,6 @@
\label{tab:path_ind}
\end{table}
-\begin{figure}
-\begin{minipage}[ht]{5.75cm}
-\mbox{\epsfig{figure=as_observe_all.eps,width=6cm}}
-\caption{Fraction of paths where a single AS can observe all
- of the links on the mix network path.}
-\label{fig:as_observe}
-\end{minipage}
-\hfill
-\begin{minipage}[ht]{5.75cm}
-\mbox{\epsfig{figure=as_observe_75,width=6cm}}
-\caption{Fraction of paths where a single AS can observe all but one
- of the links on the mix network path.%\protect\footnotemark
-}
-\label{fig:as_observe_75}
-\end{minipage}
-\hfill
-\end{figure}
-
-
%% \begin{table}[t]
%% \begin{tabular}{r|p{1.25in}|p{0.5in}p{0.5in}p{0.5in}p{0.5in}}
@@ -781,6 +762,60 @@
%% links on a 4-hop path'' is 3 out of 4 links.}
+\begin{figure}[t]
+\begin{minipage}[ht]{5.75cm}
+\mbox{\epsfig{figure=as_observe_all.eps,width=6cm}}
+\caption{Fraction of paths where a single AS can observe all
+ of the links on the mix network path.}
+\label{fig:as_observe}
+\end{minipage}
+\hfill
+\begin{minipage}[ht]{5.75cm}
+\mbox{\epsfig{figure=as_observe_75,width=6cm}}
+\caption{Fraction of paths where a single AS can observe all but one
+ of the links on the mix network path.%\protect\footnotemark
+}
+\label{fig:as_observe_75}
+\end{minipage}
+\hfill
+\end{figure}
+
+
+
+Figure~\ref{fig:as_observe} shows the probability that a single AS will
+be able to observe all of the links along the mix network path, for mix
+network paths of different lengths. Figure~\ref{fig:as_observe_75}
+shows the probability that a single AS will be able to observe all but
+one of the links along a path of a certain length. Paths of length one
+and two have less than two links and, thus, are never observed by the
+same AS twice. The AS that contains the second node in a three-hop path
+will always observe all links in the path because it is incident on both
+links on the path; for the same reason, the ASes of the second and third
+hops in a four-hop path will always be able to observe all but one link
+in the path.
+
+The figures show results for both the Tor and Mixmaster
+network topologies, with two different node selection schemes:
+(1)~allowing the same mix node to be used twice along the mix path, as
+long as the same mix node is not used for two consecutive hops (``with
+replacement'', as in {\em remailer networks}) and (2)~allowing each mix
+node to be used only once (``without replacement'', as in {\em onion
+routing}). Figure~\ref{fig:as_observe} shows two interesting results.
+First, for all mix paths shorter than four hops, a single AS can observe
+all of of the links on the mix network path. Second, Tor's node
+selection algorithm (i.e., the onion routing scheme) provides
+significant protection against observation at multiple links, but this
+node selection scheme helps Mixmaster less. For example, a four-hop
+path constructed from Tor nodes without node replacement will be
+observed by a single AS on all links with probability 0.06, whereas a
+four-hop path constructed with node replacement will be observed with
+probability 0.23. This result makes sense: because Tor has only 14
+nodes, random node selection is much more likely to result in the same
+hop being used twice along a single mix path, if this is not explicitly
+prevented.
+
+\subsection{Jurisdictional Independence of Entry and Exit Paths}
+
\begin{table}[t]
\begin{scriptsize}
@@ -842,40 +877,6 @@
\end{table}
-Figure~\ref{fig:as_observe} shows the probability that a single AS will
-be able to observe all of the links along the mix network path, for mix
-network paths of different lengths. Figure~\ref{fig:as_observe_75}
-shows the probability that a single AS will be able to observe all but
-one of the links along a path of a certain length. Paths of length one
-and two have less than two links and, thus, are never observed by the
-same AS twice. The AS that contains the second node in a three-hop path
-will always observe all links in the path because it is incident on both
-links on the path; for the same reason, the ASes of the second and third
-hops in a four-hop path will always be able to observe all but one link
-in the path.
-
-The figures show results for both the Tor and Mixmaster
-network topologies, with two different node selection schemes:
-(1)~allowing the same mix node to be used twice along the mix path, as
-long as the same mix node is not used for two consecutive hops (``with
-replacement'', as in {\em remailer networks}) and (2)~allowing each mix
-node to be used only once (``without replacement'', as in {\em onion
-routing}). Figure~\ref{fig:as_observe} shows two interesting results.
-First, for all mix paths shorter than four hops, a single AS can observe
-all of of the links on the mix network path. Second, Tor's node
-selection algorithm (i.e., the onion routing scheme) provides
-significant protection against observation at multiple links, but this
-node selection scheme helps Mixmaster less. For example, a four-hop
-path constructed from Tor nodes without node replacement will be
-observed by a single AS on all links with probability 0.06, whereas a
-four-hop path constructed with node replacement will be observed with
-probability 0.23. This result makes sense: because Tor has only 14
-nodes, random node selection is much more likely to result in the same
-hop being used twice along a single mix path, if this is not explicitly
-prevented.
-
-\subsection{Jurisdictional Independence of Entry and Exit Paths}
-
To discover the jurisdictional independence of the entry and exit paths
for typical mix networks, we used the lists of common sender and receiver
locations from Appendix~\ref{sec:send_recv} and modeled typical paths
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/