[freehaven-cvs] minor punctuation stuff, etc.

[feamster@seul.org (Nick Feamster)]

Update of /home/freehaven/cvsroot/doc/routing-zones
In directory moria.mit.edu:/tmp/cvs-serv16834

Modified Files:
	routing-zones.tex 
Log Message:
minor punctuation stuff, etc.



Index: routing-zones.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.tex,v
retrieving revision 1.44
retrieving revision 1.45
diff -u -d -r1.44 -r1.45
--- routing-zones.tex	28 Jan 2004 22:14:00 -0000	1.44
+++ routing-zones.tex	28 Jan 2004 23:37:09 -0000	1.45
@@ -209,7 +209,7 @@
 of a mix network, 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 interdomain routing (i.e., routing between
-ISPs) on the Internet, and then describe available data on Internet
+ISPs) on the Internet and then describe available data on Internet
 topologies and our assumptions regarding how well this data reflects the
 paths that packets actually travel.
 
@@ -259,7 +259,7 @@
 \label{fig:policy_summary}
 \end{figure}
 
-The BGP routing protocol is based on {\em
+BGP is based on {\em
 policy} rather than on shortest paths.  For example, the AS in
 Figure~\ref{fig:policy_summary} will
 typically prefer to route traffic to a destination via one of its
@@ -277,7 +277,7 @@
 two of its providers, two of its peers, etc.  The AS in
 Figure~\ref{fig:policy_summary} would advertise routes learned from its
 customer to all of its neighbors, but would not readvertise routes learned
-from Peer 1 to Peer 2 (and vice versa), nor to its provider; and it would
+from Peer 1 to Peer 2 (and vice versa), nor to its provider.  It would also
 advertise the routes learned from its provider to its customer, but not
 to other peers.
 
@@ -327,7 +327,7 @@
 There are many publicly-available places that provide access to routing
 table data.  The most prevalent is the Oregon RouteViews
 Project~\cite{www-routeviews}, which maintains a route server that peers
-with more than 30 ASes.  Each of these ASes sends its routing tables to
+with more than 50 ASes.  Each of these ASes sends its routing tables to
 the RouteViews server, which learns that AS's best route to each
 destination prefix.  Each AS's routing table is slightly different,
 which means that the AS-level topology constructed from the RouteViews
@@ -346,8 +346,9 @@
 Alice wants to anonymously communicate with Bob. We aim to improve
 Alice's anonymity against an adversary who can monitor a single AS,
 for example, a curious ISP or a corrupt law enforcement officer abusing
-his subpoena powers.  We assume that the ability to control
-more than one AS is significantly more difficult, either because few
+his subpoena powers.  We assume that the ability to observe
+multiple ASes is significantly more difficult than observing a single
+AS, either because few 
 ISPs control multiple ASes, or because law enforcement will
 be less willing to face the increased accountability and risk associated
 with obtaining multiple unapproved subpoenas.
@@ -379,13 +380,14 @@
 
 A successful endpoint attack against a high-latency system like
 Mixmaster takes a lot more time and effort than one against a low-latency
-system like Tor. But because an observer of even a few Mixmaster nodes
-may over time be able to link Alice to her recipients~\cite{e2e-traffic},
+system like Tor.  Because an observer of even a few Mixmaster nodes
+may be able to link Alice to her recipients over time~\cite{e2e-traffic},
 our work here also has impact on protecting such high-latency systems
 from a one-AS adversary.  Further, intra-network observations,
-along with flooding messages into the network~\cite{trickle02} or
-just waiting for periods of low traffic, may be able to aid
-the attack by shrinking the set of messages that mix with Alice's
+flooding messages into the network~\cite{trickle02}, or
+simply waiting for periods of low traffic may 
+the attack more effective by shrinking the set of messages that mix with
+Alice's 
 message~\cite{disad-free-routes,minion-design}. As a simple example,
 an adversary who learns the first half of Alice's path learns where to
 make his next phone call to track Alice's recipient.
@@ -452,7 +454,7 @@
 
 Fortunately, examining the AS paths in a BGP routing table gives a
 reasonable estimation of %the Internet's AS-level topology (i.e.,
-what ASes connect to what other ASes, and can provide reasonable
+what ASes connect to what other ASes and can provide reasonable
 information about what path an arbitrary Internet host might take to
 reach any given destination.
 %Mao {\em et al.} have recently developed
@@ -480,7 +482,7 @@
   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 be between smaller ASes; thus
+  Typically, these missing edges will be between smaller ASes; thus,
   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.  
@@ -512,7 +514,7 @@
   Internet paths to assign pairwise relationships between ASes.  That
   is, an AS path traverses a sequence of customer-provider edges, zero
   or one peering edges, and then a sequence of provider-customer
-  edges.  Therefore an AS pair in each AS path can be assigned either a
+  edges.  Therefore, each AS pair in an AS path can be assigned either a
   customer-provider or a provider-customer relationship: every pair
   before the AS with the highest degree in the path is assigned a
   customer-provider relationship, and every pair after this AS is
@@ -525,7 +527,7 @@
 
   As AS-level path estimation techniques improve,
   the accuracy of our analysis will also improve. %  More importantly,
-  Thus Alice can expect to be able to make informed decisions about the
+  Thus, Alice can expect to be able to make informed decisions about the
   mix nodes she should choose.
 \end{enumerate}
 

***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs       in the body. http://freehaven.net/