[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] touch up some typos
Update of /home/freehaven/cvsroot/doc/routing-zones
In directory moria.mit.edu:/home2/arma/work/freehaven/doc/routing-zones
Modified Files:
routing-zones.bib routing-zones.tex
Log Message:
touch up some typos
Index: routing-zones.bib
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.bib,v
retrieving revision 1.3
retrieving revision 1.4
diff -u -d -r1.3 -r1.4
--- routing-zones.bib 18 Jan 2004 01:06:24 -0000 1.3
+++ routing-zones.bib 18 Jan 2004 06:55:08 -0000 1.4
@@ -163,7 +163,7 @@
@Article{Gao2001,
author = {Lixin Gao},
- title = {On Inferring Automonous System Relationships in the {I}nternet},
+ title = {On Inferring Autonomous System Relationships in the {I}nternet},
year = {2001},
month = {December},
journal = {IEEE/ACM Transactions on Networking},
Index: routing-zones.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.tex,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -d -r1.2 -r1.3
--- routing-zones.tex 18 Jan 2004 01:06:24 -0000 1.2
+++ routing-zones.tex 18 Jan 2004 06:55:08 -0000 1.3
@@ -107,7 +107,7 @@
\subsection{Overview of Internet Routing}
-We eventually would like to determine which networks packets will
+We eventually would like to determine the networks that packets will
traverse between each node of a mix-net. To do this, we must first
understand how packets are routed between two arbitrary hosts on the
Internet. In this section, we first present a brief overview of
@@ -125,6 +125,7 @@
destinations using the information propagated by routing protocols. To
find the route to a destination IP address, a router typically performs
a longest prefix match on that IP address to find the smallest IP prefix
+% XXX do you mean 'longest' above, rather than 'smallest'? confused.
in the routing table that contains that IP address. For example, a
router performing a route lookup for {\em IP address} {\tt 18.31.0.82}
might find a route for the {\em prefix} {\tt 18.0.0.0/8}, a prefix that
@@ -138,7 +139,7 @@
The Internet's routing table has over 130,000 distinct prefixes, each of
which has an associated route. An AS that originates a route
readvertises this route to neighboring ASes via BGP and attaches its AS
-number to the {\em AS path} of the route. When a router in neighboring
+number to the {\em AS path} of the route. When a router in a neighboring
AS learns this route, that router propagates it to all of the routers in
the AS. Some of these routers will, in turn, exchange routes with other
ASes. A router will typically readvertise the route to neighboring
@@ -159,11 +160,11 @@
policy}, rather than on shortest paths. For example, an AS will
typically prefer to route traffic to a destination via one of its
customers (who pays it for connectivity) than via one of its providers
-(who it must pay to send traffic towards) or one of its peers. These
+(whom it must pay to send traffic towards) or one of its peers. These
relationships also determine which routes one AS will advertise to
another. For example, an AS will typically not advertise a route
learned from one of its peers or providers to any of its other peers or
-providers: doing so would constitute an implcit agreement to forward
+providers: doing so would constitute an implicit agreement to forward
traffic (i.e., provide ``transit'' service) between two of its
providers, two of its peers, etc. {\bf XXX maybe put a figure here}
@@ -183,9 +184,9 @@
Figure~\ref{fig:bgp_example} shows a simplified BGP routing table entry.
This router has learned two routes to the destination prefix {\tt
18.0.0.0/8} via BGP. Each route has various attributes, which include
-the ``next hop'' IP address to route packets too to use this path,
+the ``next hop'' IP address (where to route packets that use this path),
various attributes that affect which route is selected as the preferred
-route to the destiantion, and the AS path (``Path''). The ``$>$'' at
+route to the destination, and the AS path (``Path''). The ``$>$'' at
the beginning of the first line indicates that the router has selected
this route as the best route to the destination, based on applying the
BGP decision process. Each router can only have a single best route to
@@ -214,7 +215,7 @@
to draw conclusions about how vulnerable a mix-net might be to
eavesdropping by an adversary. We first provide a detailed description
of our threat model; i.e., the types of adversaries that we are trying
-to defend against. Then, we describe how our model of mix-net node
+to defend against. Then, we describe our model of mix-net node
selection. Finally, we present our techniques for estimating the
AS-level path between two arbitrary hosts on the Internet.
@@ -233,7 +234,7 @@
\subsection{AS-level path estimation}
If the initiator of a mix-net path had access to an up-to-date routing
-table of every network where it had mix nodes, then it could construct a
+table of every network containing mix nodes, then it could construct a
reasonable estimate of the AS-level path fairly easily: to discover the
AS-level path between nodes $i$ and $i+1$, for example, the initiator
could look at $i$'s routing table and determine the AS path associated
@@ -260,7 +261,7 @@
reasonable estimation of the Internet's AS-level topology (i.e., what
ASes connect to what other ASes, etc.) and can provide reasonable
information about what path an arbitrary Internet host might take to
-reach any given destiantion. Mao {\em et al.} have recently developed
+reach any given destination. Mao {\em et al.} have recently developed
similar techniques for passively determining AS-level paths between two
Internet hosts~\cite{Mao2004}, given a view of the AS-level topology.
We now summarize our technique, which is very similar to this proposed
@@ -277,12 +278,12 @@
the AS-level topology of the Internet.
\vspace{0.1in}
- Of course, because the policies that are applied due to commercial
- relationships (i.e., an AS may filter routes learned from one peer
- when advertising routes to another peer or provider, etc.) certain
+ Of course, because the policies are applied based on commercial
+ relationships (e.g., an AS may filter routes learned from one peer
+ when advertising routes to another peer or provider), certain
edges in this graph will not be globally visible. As a result, our
approximation of the AS-level graph may omit certain edges.
- Typically, these missing edges will between smaller ASes; this means
+ Typically, these missing edges will be between smaller ASes; this means
that our algorithm may not realize that a particular edge exists
between two ASes and, as a result, infer the wrong AS-level path to a
destination.
@@ -318,7 +319,7 @@
\section{Results}
-[We should of course take a look at these questions in the abstract,
+[We should of course take a look at these questions abstractly,
to get a feel for how to answer them, but I'd like to get results on
the actual real-world networks too. I can easily make a list of current
Tor nodes, current Mixminion nodes, current Mixmaster nodes, and we
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/